Base | Representation |
---|---|
bin | 11101000111110010001… |
… | …000110111011101011111 |
3 | 21002022111121122012121102 |
4 | 131013302020313131133 |
5 | 230242000341000411 |
6 | 4131203201023315 |
7 | 264404103026546 |
oct | 35076210673537 |
9 | 7068447565542 |
10 | 2001222203231 |
11 | 7017938421a9 |
12 | 283a25324b3b |
13 | 116939830a54 |
14 | 6cc06d1d15d |
15 | 370ca451d3b |
hex | 1d1f223775f |
2001222203231 has 2 divisors, whose sum is σ = 2001222203232. Its totient is φ = 2001222203230.
The previous prime is 2001222203153. The next prime is 2001222203251. The reversal of 2001222203231 is 1323022221002.
It is a happy number.
It is an a-pointer prime, because the next prime (2001222203251) can be obtained adding 2001222203231 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001222203231 is a prime.
It is a super-2 number, since 2×20012222032312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001222203251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000611101615 + 1000611101616.
It is an arithmetic number, because the mean of its divisors is an integer number (1000611101616).
Almost surely, 22001222203231 is an apocalyptic number.
2001222203231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001222203231 is an equidigital number, since it uses as much as digits as its factorization.
2001222203231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2001222203231 its reverse (1323022221002), we get a palindrome (3324244424233).
The spelling of 2001222203231 in words is "two trillion, one billion, two hundred twenty-two million, two hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •