Base | Representation |
---|---|
bin | 10010101110101101… |
… | …011100111111111111 |
3 | 1220220120102200002202 |
4 | 102232231130333333 |
5 | 312141410120111 |
6 | 13123332542115 |
7 | 1311240564314 |
oct | 225655347777 |
9 | 56816380082 |
10 | 20111020031 |
11 | 8590168013 |
12 | 3a9318193b |
13 | 1b866a936b |
14 | d8ad44d0b |
15 | 7ca89ab3b |
hex | 4aeb5cfff |
20111020031 has 2 divisors, whose sum is σ = 20111020032. Its totient is φ = 20111020030.
The previous prime is 20111020019. The next prime is 20111020037. The reversal of 20111020031 is 13002011102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20111020031 - 234 = 2931150847 is a prime.
It is a super-2 number, since 2×201110200312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20111019994 and 20111020021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111020037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055510015 + 10055510016.
It is an arithmetic number, because the mean of its divisors is an integer number (10055510016).
Almost surely, 220111020031 is an apocalyptic number.
20111020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111020031 is an equidigital number, since it uses as much as digits as its factorization.
20111020031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20111020031 its reverse (13002011102), we get a palindrome (33113031133).
The spelling of 20111020031 in words is "twenty billion, one hundred eleven million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •