Base | Representation |
---|---|
bin | 100000000001000110001… |
… | …101100011000001111111 |
3 | 21210100002210202011110221 |
4 | 200001012031203001333 |
5 | 242022003002241111 |
6 | 4402431455442211 |
7 | 314650015505044 |
oct | 40010615430177 |
9 | 7710083664427 |
10 | 2200201212031 |
11 | 779111252619 |
12 | 2b64b6b26367 |
13 | 12c62a473404 |
14 | 786c158b1cb |
15 | 3c373e4a371 |
hex | 2004636307f |
2200201212031 has 2 divisors, whose sum is σ = 2200201212032. Its totient is φ = 2200201212030.
The previous prime is 2200201211909. The next prime is 2200201212059. The reversal of 2200201212031 is 1302121020022.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2200201212031 - 29 = 2200201211519 is a prime.
It is a super-2 number, since 2×22002012120312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2200201211996 and 2200201212014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2200201212061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100100606015 + 1100100606016.
It is an arithmetic number, because the mean of its divisors is an integer number (1100100606016).
Almost surely, 22200201212031 is an apocalyptic number.
2200201212031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200201212031 is an equidigital number, since it uses as much as digits as its factorization.
2200201212031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2200201212031 its reverse (1302121020022), we get a palindrome (3502322232053).
The spelling of 2200201212031 in words is "two trillion, two hundred billion, two hundred one million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •