If $A=1$, $B=2$, etc, then what word, treated as a product of its letters, has value closest to $1000000$? Suppose that a product $n$ is the product of the numbers corresponding to its letter, eg. $A = 1$, $B = 2$, etc.

What is the word that has a product close $1000000$?

Here's some examples:
$$\begin{align}
8 &= BAD = 2 \times 1 \times 4 = 8 \\
6 &= CAB = 3 \times 1 \times 2 = 6 \\
168000 &= ADJACENT
\end{align}$$

EDIT : Heres some what I did.
First, I chopped $1,000,000$ into $10^{6}$, or $10 \times 10 \times 10 \times 10 \times 10 \times 10$.
Then, I factored each $10$ into $2 \times 5$.
Then, I tried to to combine the $2$'s and $5$'s in different quantity. In short, I produced the letters : $A$, $B$, $D$, $E$, $H$, $P$, $J$, and other letters.
Then, I think I can't produce some word that has a meaning and makes sense, because it exceeds the limitation of $1,000,000$. How do I get it through?
 A: The word TYPEY, a variant spelling of TYPY, works exactly.
(Link is to the Dictionary.com definition.)
A: You're going to struggle to get 1,000,000 exactly, as there are only 9 factors less than 26. These are 1, 2, 4, 5, 8, 10, 16, 20, and 25.
Therefore your allowed letters are A, B, D, E, H, J, P, T, and Y.
I haven't been able to come up with a word from those that gets you 1,000,000 - but if you mess around with some fun words you can definitely get close:
HAUNTED = 940,800, JUMPY = 1,092,000
A: I searched Mathematica's built-in dictionary...
value[char_] := ToCharacterCode[char] - ToCharacterCode["a"] + 1
wordValue[word_] := Times @@ (value /@ Characters[word])

words = ToLowerCase /@ 
  DictionaryLookup[("a"|"b"|"d"|"e"|"h"|"j"|"p"|"t"|"y").., IgnoreCase -> True];
Select[words, wordValue[#] == 1000000 &]

...and found nothing that works exactly. The closest we can get from above (by modifying the code to try to get as close as possible) is with CURING or NICARAGUA (1000188) and the closest we can get from below is with BANQUET (999600).
