Base | Representation |
---|---|
bin | 1001101001100111001100… |
… | …01110111100100100001101 |
3 | 2210010201010001111001100221 |
4 | 10310303212032330210031 |
5 | 10240141102241320023 |
6 | 113044443205351341 |
7 | 4320111122216032 |
oct | 464634616744415 |
9 | 83121101431327 |
10 | 21221001120013 |
11 | 68418599a1462 |
12 | 2468932408551 |
13 | bac1937b6276 |
14 | 53515d9cb389 |
15 | 26c01864085d |
hex | 134ce63bc90d |
21221001120013 has 2 divisors, whose sum is σ = 21221001120014. Its totient is φ = 21221001120012.
The previous prime is 21221001120001. The next prime is 21221001120089. The reversal of 21221001120013 is 31002110012212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12542633067364 + 8678368052649 = 3541558^2 + 2945907^2 .
It is a cyclic number.
It is not a de Polignac number, because 21221001120013 - 233 = 21212411185421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21221071120013) 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, 10610500560006 + 10610500560007.
It is an arithmetic number, because the mean of its divisors is an integer number (10610500560007).
Almost surely, 221221001120013 is an apocalyptic number.
It is an amenable number.
21221001120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21221001120013 is an equidigital number, since it uses as much as digits as its factorization.
21221001120013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 21221001120013 its reverse (31002110012212), we get a palindrome (52223111132225).
The spelling of 21221001120013 in words is "twenty-one trillion, two hundred twenty-one billion, one million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •