Base | Representation |
---|---|
bin | 11110111000010111000… |
… | …101010101110000011111 |
3 | 21111212111212122102021221 |
4 | 132320113011111300133 |
5 | 234232030341320111 |
6 | 4302514011434211 |
7 | 306213433620604 |
oct | 36702705256037 |
9 | 7455455572257 |
10 | 2122101120031 |
11 | 748a83839542 |
12 | 2a333b455967 |
13 | 125161b3c319 |
14 | 749d2c946ab |
15 | 3a30266c371 |
hex | 1ee17155c1f |
2122101120031 has 2 divisors, whose sum is σ = 2122101120032. Its totient is φ = 2122101120030.
The previous prime is 2122101120017. The next prime is 2122101120049. The reversal of 2122101120031 is 1300211012212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2122101120031 - 29 = 2122101119519 is a prime.
It is a super-2 number, since 2×21221011200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2122101119987 and 2122101120014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2122101120091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1061050560015 + 1061050560016.
It is an arithmetic number, because the mean of its divisors is an integer number (1061050560016).
Almost surely, 22122101120031 is an apocalyptic number.
2122101120031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122101120031 is an equidigital number, since it uses as much as digits as its factorization.
2122101120031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2122101120031 its reverse (1300211012212), we get a palindrome (3422312132243).
The spelling of 2122101120031 in words is "two trillion, one hundred twenty-two billion, one hundred one million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •