Here is the question that my child was assigned as extra credit work at school:

What is the product of all whole numbers less than 100 whose names (in English) contain a subset of the letters e, f, g, h, i, t, n, r - with no letter appearing more than once per number.

Can anybody help with this question? Please!

lanaharman@msn.com