Base | Representation |
---|---|
bin | 1010000000111001101100… |
… | …11001111101100011111101 |
3 | 2212222012120222212011202122 |
4 | 11000130312121331203331 |
5 | 10341243414241231023 |
6 | 114500223153132325 |
7 | 4431660054305033 |
oct | 500346631754375 |
9 | 85865528764678 |
10 | 22021210102013 |
11 | 7020163013451 |
12 | 2577a3685a0a5 |
13 | c3978bb43315 |
14 | 561b919d2553 |
15 | 282c4ee632c8 |
hex | 14073667d8fd |
22021210102013 has 2 divisors, whose sum is σ = 22021210102014. Its totient is φ = 22021210102012.
The previous prime is 22021210101991. The next prime is 22021210102027. The reversal of 22021210102013 is 31020101212022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16673845223044 + 5347364878969 = 4083362^2 + 2312437^2 .
It is a cyclic number.
It is not a de Polignac number, because 22021210102013 - 232 = 22016915134717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22021210101982 and 22021210102000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22021210108013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11010605051006 + 11010605051007.
It is an arithmetic number, because the mean of its divisors is an integer number (11010605051007).
Almost surely, 222021210102013 is an apocalyptic number.
It is an amenable number.
22021210102013 is a deficient number, since it is larger than the sum of its proper divisors (1).
22021210102013 is an equidigital number, since it uses as much as digits as its factorization.
22021210102013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 22021210102013 its reverse (31020101212022), we get a palindrome (53041311314035).
The spelling of 22021210102013 in words is "twenty-two trillion, twenty-one billion, two hundred ten million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •