Base | Representation |
---|---|
bin | 100001101001001110000… |
… | …000101100011010101111 |
3 | 22012000200100011111220121 |
4 | 201221032000230122233 |
5 | 300334434302210111 |
6 | 4530041345425411 |
7 | 326015355014062 |
oct | 41511600543257 |
9 | 8160610144817 |
10 | 2312001210031 |
11 | 811572455887 |
12 | 3140b863b267 |
13 | 13a03685c496 |
14 | 7dc898468d9 |
15 | 4021909a871 |
hex | 21a4e02c6af |
2312001210031 has 2 divisors, whose sum is σ = 2312001210032. Its totient is φ = 2312001210030.
The previous prime is 2312001209927. The next prime is 2312001210059. The reversal of 2312001210031 is 1300121002132.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2312001210031 is a prime.
It is a super-2 number, since 2×23120012100312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2312001209987 and 2312001210014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2312001210931) 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, 1156000605015 + 1156000605016.
It is an arithmetic number, because the mean of its divisors is an integer number (1156000605016).
Almost surely, 22312001210031 is an apocalyptic number.
2312001210031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2312001210031 is an equidigital number, since it uses as much as digits as its factorization.
2312001210031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2312001210031 its reverse (1300121002132), we get a palindrome (3612122212163).
The spelling of 2312001210031 in words is "two trillion, three hundred twelve billion, one million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •