The linguistic hardness ($LH$) of a natural number is the ratio of the amount of letters in the writing of this number in English to the amount of its digits.  

For example, $LH(1234) = 7.75$, as:

$$\frac{\mbox{Number of letters}}{\mbox{Number of digits}} = \frac{\mbox{N(one thousand two hundred thirty four)}}{N(1234)}= 31/4 = 7.75$$

What the is $N: 0<N<10^9$ with biggest $LH(N)$?

P.S. This puzzle appears to be much more interesting in Russian, but this is not Russian site to ask it here.