Base | Representation |
---|---|
bin | 100000010011100011000… |
… | …001110010000111101001 |
3 | 21212020020110021111022212 |
4 | 200103203001302013221 |
5 | 242333041034121301 |
6 | 4415505350054505 |
7 | 316250652551213 |
oct | 40234301620751 |
9 | 7766213244285 |
10 | 2220012020201 |
11 | 786557a00a58 |
12 | 2ba30564a435 |
13 | 1314668a9401 |
14 | 796406a55b3 |
15 | 3cb332944bb |
hex | 204e30721e9 |
2220012020201 has 2 divisors, whose sum is σ = 2220012020202. Its totient is φ = 2220012020200.
The previous prime is 2220012020167. The next prime is 2220012020203. The reversal of 2220012020201 is 1020202100222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1416335629801 + 803676390400 = 1190099^2 + 896480^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220012020201 - 210 = 2220012019177 is a prime.
Together with 2220012020203, 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 (2220012020203) 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, 1110006010100 + 1110006010101.
It is an arithmetic number, because the mean of its divisors is an integer number (1110006010101).
Almost surely, 22220012020201 is an apocalyptic number.
It is an amenable number.
2220012020201 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220012020201 is an equidigital number, since it uses as much as digits as its factorization.
2220012020201 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 2220012020201 its reverse (1020202100222), we get a palindrome (3240214120423).
The spelling of 2220012020201 in words is "two trillion, two hundred twenty billion, twelve million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •