Quote:
Originally Posted by LaurV
To calculate how many digits in base 5 will \(10^{1000000}\) have, you need to compute \(\log_5 10^{1000000}\).
To calculate how many bits will \(10^{1000000}\) have, you need to compute \(\log_2 10^{1000000}\). That is the power of 2 you need to raise 2 to get 10^1M (i.e a number with 1M digits). Then round it to the next prime.
|
But keep also in mind that 10^1000000 has 1000001 digits, and 10^999999 has 1000000 digits.