Base | Representation |
---|---|
bin | 1001100011011110100100… |
… | …01111000110110001100001 |
3 | 2202101120000210222110101012 |
4 | 10301233102033012301201 |
5 | 10223212403312020001 |
6 | 112403542551550305 |
7 | 4265636434144034 |
oct | 461572217066141 |
9 | 82346023873335 |
10 | 21010212220001 |
11 | 6770421076a74 |
12 | 2433b0568b395 |
13 | b953402121b4 |
14 | 528c84aab01b |
15 | 2667cce2a2bb |
hex | 131bd23c6c61 |
21010212220001 has 2 divisors, whose sum is σ = 21010212220002. Its totient is φ = 21010212220000.
The previous prime is 21010212219889. The next prime is 21010212220003. The reversal of 21010212220001 is 10002221201012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20340785525776 + 669426694225 = 4510076^2 + 818185^2 .
It is a cyclic number.
It is not a de Polignac number, because 21010212220001 - 210 = 21010212218977 is a prime.
It is a Sophie Germain prime.
Together with 21010212220003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (21010212220003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505106110000 + 10505106110001.
It is an arithmetic number, because the mean of its divisors is an integer number (10505106110001).
Almost surely, 221010212220001 is an apocalyptic number.
It is an amenable number.
21010212220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
21010212220001 is an equidigital number, since it uses as much as digits as its factorization.
21010212220001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21010212220001 its reverse (10002221201012), we get a palindrome (31012433421013).
The spelling of 21010212220001 in words is "twenty-one trillion, ten billion, two hundred twelve million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •