Base | Representation |
---|---|
bin | 1001101001100111001100… |
… | …01111010000010110011101 |
3 | 2210010201010001122011112102 |
4 | 10310303212033100112131 |
5 | 10240141102301413203 |
6 | 113044443211214445 |
7 | 4320111123004223 |
oct | 464634617202635 |
9 | 83121101564472 |
10 | 21221001201053 |
11 | 6841859a47335 |
12 | 2468932447425 |
13 | bac193814114 |
14 | 53515da0cb13 |
15 | 26c018659888 |
hex | 134ce63d059d |
21221001201053 has 2 divisors, whose sum is σ = 21221001201054. Its totient is φ = 21221001201052.
The previous prime is 21221001201019. The next prime is 21221001201167. The reversal of 21221001201053 is 35010210012212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19015547505124 + 2205453695929 = 4360682^2 + 1485077^2 .
It is a cyclic number.
It is not a de Polignac number, because 21221001201053 - 212 = 21221001196957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21221001207053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610500600526 + 10610500600527.
It is an arithmetic number, because the mean of its divisors is an integer number (10610500600527).
Almost surely, 221221001201053 is an apocalyptic number.
It is an amenable number.
21221001201053 is a deficient number, since it is larger than the sum of its proper divisors (1).
21221001201053 is an equidigital number, since it uses as much as digits as its factorization.
21221001201053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 21221001201053 its reverse (35010210012212), we get a palindrome (56231211213265).
The spelling of 21221001201053 in words is "twenty-one trillion, two hundred twenty-one billion, one million, two hundred one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •