Base | Representation |
---|---|
bin | 1001101001100101100001… |
… | …01001111000011000011101 |
3 | 2210010121210102000202011021 |
4 | 10310302300221320120131 |
5 | 10240132232131223401 |
6 | 113044214054524141 |
7 | 4320046625503243 |
oct | 464626051703035 |
9 | 83117712022137 |
10 | 21220102211101 |
11 | 6841438544932 |
12 | 2468721366651 |
13 | bac07c4b23c1 |
14 | 5350b6476793 |
15 | 26beb477c2a1 |
hex | 134cb0a7861d |
21220102211101 has 2 divisors, whose sum is σ = 21220102211102. Its totient is φ = 21220102211100.
The previous prime is 21220102211093. The next prime is 21220102211123. The reversal of 21220102211101 is 10111220102212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16625402785476 + 4594699425625 = 4077426^2 + 2143525^2 .
It is a cyclic number.
It is not a de Polignac number, because 21220102211101 - 23 = 21220102211093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21220102211141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610051105550 + 10610051105551.
It is an arithmetic number, because the mean of its divisors is an integer number (10610051105551).
Almost surely, 221220102211101 is an apocalyptic number.
It is an amenable number.
21220102211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220102211101 is an equidigital number, since it uses as much as digits as its factorization.
21220102211101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21220102211101 its reverse (10111220102212), we get a palindrome (31331322313313).
It can be divided in two parts, 21220 and 102211101, that added together give a square (102232321 = 101112).
The spelling of 21220102211101 in words is "twenty-one trillion, two hundred twenty billion, one hundred two million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •