This Javascript searches the number whose totient is given.
That is solve φ(x) = a, returns the lowest x.
The upper limit for x is given by φ(x) > x.Ln(2)/(Ln(x) + Ln(2))
The lower limit is of course a+1.
The program searches by brute force, hence can't be used for large values of a.