Sorry for my bad English.
I started to read book about algorithms(Introduction to Algorithms) and there is a problem, I should find a valid $n$ for $$n \times \log_2(n) = q $$ q might be very big number ($3\times10^{15}$)
I know that I can write a regular brute force program, but it doesn't work, if q is very large number.