Base | Representation |
---|---|
bin | 11101000111110010001… |
… | …000111001001000111101 |
3 | 21002022111121122120001011 |
4 | 131013302020321020331 |
5 | 230242000341210414 |
6 | 4131203201115221 |
7 | 264404103055603 |
oct | 35076210711075 |
9 | 7068447576034 |
10 | 2001222210109 |
11 | 701793847391 |
12 | 283a25328b11 |
13 | 116939833c15 |
14 | 6cc06d21873 |
15 | 370ca453dc4 |
hex | 1d1f223923d |
2001222210109 has 2 divisors, whose sum is σ = 2001222210110. Its totient is φ = 2001222210108.
The previous prime is 2001222210007. The next prime is 2001222210131. The reversal of 2001222210109 is 9010122221002.
It is an a-pointer prime, because the next prime (2001222210131) can be obtained adding 2001222210109 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1509150825625 + 492071384484 = 1228475^2 + 701478^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001222210109 - 27 = 2001222209981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2001222210109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001222210409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000611105054 + 1000611105055.
It is an arithmetic number, because the mean of its divisors is an integer number (1000611105055).
Almost surely, 22001222210109 is an apocalyptic number.
It is an amenable number.
2001222210109 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001222210109 is an equidigital number, since it uses as much as digits as its factorization.
2001222210109 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 22.
The spelling of 2001222210109 in words is "two trillion, one billion, two hundred twenty-two million, two hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •