Base | Representation |
---|---|
bin | 100000000001000001010… |
… | …111110010110110111101 |
3 | 21210022220010221210021120 |
4 | 200001001113302312331 |
5 | 242021321210342341 |
6 | 4402415435221153 |
7 | 314645011353645 |
oct | 40010127626675 |
9 | 7708803853246 |
10 | 2200120012221 |
11 | 77907a431a3a |
12 | 2b64938a77b9 |
13 | 12c6166b2ba1 |
14 | 786b4891525 |
15 | 3c36bc5b066 |
hex | 200415f2dbd |
2200120012221 has 16 divisors (see below), whose sum is σ = 3013276428864. Its totient is φ = 1426868279424.
The previous prime is 2200120012219. The next prime is 2200120012231. The reversal of 2200120012221 is 1222100210022.
It is not a de Polignac number, because 2200120012221 - 21 = 2200120012219 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2200120012221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200120012231) 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 in 15 ways as a sum of consecutive naturals, for example, 969216 + ... + 2310761.
It is an arithmetic number, because the mean of its divisors is an integer number (188329776804).
Almost surely, 22200120012221 is an apocalyptic number.
It is an amenable number.
2200120012221 is a deficient number, since it is larger than the sum of its proper divisors (813156416643).
2200120012221 is a wasteful number, since it uses less digits than its factorization.
2200120012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3286060.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2200120012221 its reverse (1222100210022), we get a palindrome (3422220222243).
The spelling of 2200120012221 in words is "two trillion, two hundred billion, one hundred twenty million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •