Base | Representation |
---|---|
bin | 1001101001100101100001… |
… | …01001110101111010111101 |
3 | 2210010121210102000020022221 |
4 | 10310302300221311322331 |
5 | 10240132232130413041 |
6 | 113044214054405341 |
7 | 4320046625431663 |
oct | 464626051657275 |
9 | 83117712006287 |
10 | 21220102201021 |
11 | 68414385382a9 |
12 | 2468721360851 |
13 | bac07c4aa939 |
14 | 5350b6472c33 |
15 | 26beb47792d1 |
hex | 134cb0a75ebd |
21220102201021 has 2 divisors, whose sum is σ = 21220102201022. Its totient is φ = 21220102201020.
The previous prime is 21220102200991. The next prime is 21220102201069. The reversal of 21220102201021 is 12010220102212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15643013765625 + 5577088435396 = 3955125^2 + 2361586^2 .
It is a cyclic number.
It is not a de Polignac number, because 21220102201021 - 239 = 20670346387133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21220102200986 and 21220102201004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21220102205021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610051100510 + 10610051100511.
It is an arithmetic number, because the mean of its divisors is an integer number (10610051100511).
Almost surely, 221220102201021 is an apocalyptic number.
It is an amenable number.
21220102201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220102201021 is an equidigital number, since it uses as much as digits as its factorization.
21220102201021 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 16.
Adding to 21220102201021 its reverse (12010220102212), we get a palindrome (33230322303233).
The spelling of 21220102201021 in words is "twenty-one trillion, two hundred twenty billion, one hundred two million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •