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$: Number of letters (one thousand two hundred thirty four) / Number of digits $(1234) = 31/4 = 7.75$.
What is $N: 0<N<10^9$ with biggest $LH(N)$?