Base | Representation |
---|---|
bin | 1001101001010010101111… |
… | …10101011011100100110101 |
3 | 2210002122202220120200012001 |
4 | 10310221113311123210311 |
5 | 10240001111131211041 |
6 | 113035425531455301 |
7 | 4316242056315502 |
oct | 464512765334465 |
9 | 83078686520161 |
10 | 21210022132021 |
11 | 6838135605268 |
12 | 24667895b7531 |
13 | bab134037878 |
14 | 5347db82a4a9 |
15 | 26bac4852131 |
hex | 134a57d5b935 |
21210022132021 has 2 divisors, whose sum is σ = 21210022132022. Its totient is φ = 21210022132020.
The previous prime is 21210022132009. The next prime is 21210022132031. The reversal of 21210022132021 is 12023122001212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21179195551396 + 30826580625 = 4602086^2 + 175575^2 .
It is a cyclic number.
It is not a de Polignac number, because 21210022132021 - 211 = 21210022129973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21210022132021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21210022132001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605011066010 + 10605011066011.
It is an arithmetic number, because the mean of its divisors is an integer number (10605011066011).
Almost surely, 221210022132021 is an apocalyptic number.
It is an amenable number.
21210022132021 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210022132021 is an equidigital number, since it uses as much as digits as its factorization.
21210022132021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 21210022132021 its reverse (12023122001212), we get a palindrome (33233144133233).
The spelling of 21210022132021 in words is "twenty-one trillion, two hundred ten billion, twenty-two million, one hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •