Base | Representation |
---|---|
bin | 100000010011101001100… |
… | …101010101001001010001 |
3 | 21212020112010020010222212 |
4 | 200103221211111021101 |
5 | 242333302213031001 |
6 | 4415524315241505 |
7 | 316253456435651 |
oct | 40235145251121 |
9 | 7766463203885 |
10 | 2220122002001 |
11 | 786603a9aa02 |
12 | 2ba336449295 |
13 | 1314836063b7 |
14 | 79651134361 |
15 | 3cb3cc6b7bb |
hex | 204e9955251 |
2220122002001 has 2 divisors, whose sum is σ = 2220122002002. Its totient is φ = 2220122002000.
The previous prime is 2220122001971. The next prime is 2220122002003. The reversal of 2220122002001 is 1002002210222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2192401416976 + 27720585025 = 1480676^2 + 166495^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220122002001 - 222 = 2220117807697 is a prime.
Together with 2220122002003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2220122002003) 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, 1110061001000 + 1110061001001.
It is an arithmetic number, because the mean of its divisors is an integer number (1110061001001).
Almost surely, 22220122002001 is an apocalyptic number.
It is an amenable number.
2220122002001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220122002001 is an equidigital number, since it uses as much as digits as its factorization.
2220122002001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 2220122002001 its reverse (1002002210222), we get a palindrome (3222124212223).
The spelling of 2220122002001 in words is "two trillion, two hundred twenty billion, one hundred twenty-two million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •