Base | Representation |
---|---|
bin | 1001000110101010001110… |
… | …1100010110001100010001 |
3 | 1022102221121111211122020002 |
4 | 2101222203230112030101 |
5 | 2303001010122023441 |
6 | 33142312330455345 |
7 | 2052125426030252 |
oct | 221524354261421 |
9 | 38387544748202 |
10 | 10010020111121 |
11 | 320a253434898 |
12 | 1158013594555 |
13 | 577c30067864 |
14 | 2686b7c08b29 |
15 | 1255b4974b9b |
hex | 91aa3b16311 |
10010020111121 has 2 divisors, whose sum is σ = 10010020111122. Its totient is φ = 10010020111120.
The previous prime is 10010020111067. The next prime is 10010020111151. The reversal of 10010020111121 is 12111102001001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5134932749521 + 4875087361600 = 2266039^2 + 2207960^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010020111121 - 218 = 10010019848977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10010020111151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005010055560 + 5005010055561.
It is an arithmetic number, because the mean of its divisors is an integer number (5005010055561).
Almost surely, 210010020111121 is an apocalyptic number.
It is an amenable number.
10010020111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010020111121 is an equidigital number, since it uses as much as digits as its factorization.
10010020111121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10010020111121 its reverse (12111102001001), we get a palindrome (22121122112122).
The spelling of 10010020111121 in words is "ten trillion, ten billion, twenty million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •