Base | Representation |
---|---|
bin | 11110110110011001110… |
… | …110010001111000111111 |
3 | 21111200002110001110221102 |
4 | 132312121312101320333 |
5 | 234213230001120111 |
6 | 4301525313523315 |
7 | 306110401562615 |
oct | 36663166217077 |
9 | 7450073043842 |
10 | 2120000020031 |
11 | 7480a5819a63 |
12 | 2a2a5387353b |
13 | 124bb875789a |
14 | 74873bdd6b5 |
15 | 3a22ce8913b |
hex | 1ed99d91e3f |
2120000020031 has 2 divisors, whose sum is σ = 2120000020032. Its totient is φ = 2120000020030.
The previous prime is 2120000020013. The next prime is 2120000020067. The reversal of 2120000020031 is 1300200000212.
It is a happy number.
Together with previous prime (2120000020013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2120000020031 - 214 = 2120000003647 is a prime.
It is a super-2 number, since 2×21200000200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2120000019994 and 2120000020021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120000020631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060000010015 + 1060000010016.
It is an arithmetic number, because the mean of its divisors is an integer number (1060000010016).
Almost surely, 22120000020031 is an apocalyptic number.
2120000020031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120000020031 is an equidigital number, since it uses as much as digits as its factorization.
2120000020031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 2120000020031 its reverse (1300200000212), we get a palindrome (3420200020243).
The spelling of 2120000020031 in words is "two trillion, one hundred twenty billion, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •