Base | Representation |
---|---|
bin | 11101000111110010001… |
… | …000100011101011100011 |
3 | 21002022111121111002110200 |
4 | 131013302020203223203 |
5 | 230242000330402321 |
6 | 4131203155200243 |
7 | 264404102241414 |
oct | 35076210435343 |
9 | 7068447432420 |
10 | 2001222122211 |
11 | 701793797344 |
12 | 283a252a6083 |
13 | 116939802c00 |
14 | 6cc06cdb80b |
15 | 370ca437d26 |
hex | 1d1f2223ae3 |
2001222122211 has 36 divisors (see below), whose sum is σ = 3130449496200. Its totient is φ = 1231390353024.
The previous prime is 2001222122209. The next prime is 2001222122213. The reversal of 2001222122211 is 1122212221002.
It is a happy number.
2001222122211 is a `hidden beast` number, since 200 + 12 + 221 + 22 + 211 = 666.
It is an interprime number because it is at equal distance from previous prime (2001222122209) and next prime (2001222122213).
It is not a de Polignac number, because 2001222122211 - 21 = 2001222122209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2001222122213) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 15356535 + ... + 15486303.
It is an arithmetic number, because the mean of its divisors is an integer number (86956930450).
Almost surely, 22001222122211 is an apocalyptic number.
2001222122211 is a deficient number, since it is larger than the sum of its proper divisors (1129227373989).
2001222122211 is a wasteful number, since it uses less digits than its factorization.
2001222122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139940 (or 139924 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2001222122211 its reverse (1122212221002), we get a palindrome (3123434343213).
The spelling of 2001222122211 in words is "two trillion, one billion, two hundred twenty-two million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •