The number of digits in an exponent of two

67 Views Asked by At

At the moment my area of research is Mersenne Primes. I am currently looking into a specifically large exponent, $\ 2^{112401533}-1$, and I can’t help but wonder how I would calculate how many digits a number like that would have. Has anyone got any ideas on ways to estimate the number of digits in large exponents of two? (Or any other number - the results do not have to be exact, but more akin to a smart estimate on the number of digits).