Base | Representation |
---|---|
bin | 11101001000110011000… |
… | …110100100101110001111 |
3 | 21002102022120111210000202 |
4 | 131020303012210232033 |
5 | 230301213400334411 |
6 | 4131503253444115 |
7 | 264443106132212 |
oct | 35106306445617 |
9 | 7072276453022 |
10 | 2002312121231 |
11 | 7021a2aa0784 |
12 | 28408a34063b |
13 | 116a81591746 |
14 | 6ccab995779 |
15 | 37140e9583b |
hex | 1d2331a4b8f |
2002312121231 has 2 divisors, whose sum is σ = 2002312121232. Its totient is φ = 2002312121230.
The previous prime is 2002312121213. The next prime is 2002312121239. The reversal of 2002312121231 is 1321212132002.
Together with previous prime (2002312121213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002312121231 is a prime.
It is a super-3 number, since 3×20023121212313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002312121239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001156060615 + 1001156060616.
It is an arithmetic number, because the mean of its divisors is an integer number (1001156060616).
Almost surely, 22002312121231 is an apocalyptic number.
2002312121231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002312121231 is an equidigital number, since it uses as much as digits as its factorization.
2002312121231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2002312121231 its reverse (1321212132002), we get a palindrome (3323524253233).
The spelling of 2002312121231 in words is "two trillion, two billion, three hundred twelve million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •