Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …111011010111000101111 |
3 | 21111212020220020220012212 |
4 | 132320101013122320233 |
5 | 234231324224031111 |
6 | 4302500033521035 |
7 | 306211106624441 |
oct | 36702107327057 |
9 | 7455226226185 |
10 | 2122001002031 |
11 | 748a32277399 |
12 | 2a3311a1317b |
13 | 125147186bc1 |
14 | 749c3872491 |
15 | 3a2e899298b |
hex | 1ee111dae2f |
2122001002031 has 2 divisors, whose sum is σ = 2122001002032. Its totient is φ = 2122001002030.
The previous prime is 2122001002007. The next prime is 2122001002091. The reversal of 2122001002031 is 1302001002212.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2122001002031 - 210 = 2122001001007 is a prime.
It is a super-2 number, since 2×21220010020312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2122001001997 and 2122001002015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2122001002091) 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, 1061000501015 + 1061000501016.
It is an arithmetic number, because the mean of its divisors is an integer number (1061000501016).
Almost surely, 22122001002031 is an apocalyptic number.
2122001002031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122001002031 is an equidigital number, since it uses as much as digits as its factorization.
2122001002031 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 14.
Adding to 2122001002031 its reverse (1302001002212), we get a palindrome (3424002004243).
The spelling of 2122001002031 in words is "two trillion, one hundred twenty-two billion, one million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •