Base | Representation |
---|---|
bin | 1001100111111010100000… |
… | …10010111100001111011101 |
3 | 2202221010111112110100012202 |
4 | 10303331100102330033131 |
5 | 10233212102124310023 |
6 | 113001553200141245 |
7 | 4312644135400202 |
oct | 463752022741735 |
9 | 82833445410182 |
10 | 21162651010013 |
11 | 681a036871157 |
12 | 2459569007825 |
13 | ba6824b0c166 |
14 | 5323c62d7ca9 |
15 | 26a750b94128 |
hex | 133f504bc3dd |
21162651010013 has 2 divisors, whose sum is σ = 21162651010014. Its totient is φ = 21162651010012.
The previous prime is 21162651010001. The next prime is 21162651010031. The reversal of 21162651010013 is 31001015626112.
Together with next prime (21162651010031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17794240495684 + 3368410514329 = 4218322^2 + 1835323^2 .
It is a cyclic number.
It is not a de Polignac number, because 21162651010013 - 224 = 21162634232797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21162651010043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10581325505006 + 10581325505007.
It is an arithmetic number, because the mean of its divisors is an integer number (10581325505007).
Almost surely, 221162651010013 is an apocalyptic number.
It is an amenable number.
21162651010013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21162651010013 is an equidigital number, since it uses as much as digits as its factorization.
21162651010013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
Adding to 21162651010013 its reverse (31001015626112), we get a palindrome (52163666636125).
The spelling of 21162651010013 in words is "twenty-one trillion, one hundred sixty-two billion, six hundred fifty-one million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •