Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …01000101010010001101101 |
3 | 2220121111022002100220011001 |
4 | 11003011033220222101231 |
5 | 10402224220113341023 |
6 | 115115245040000301 |
7 | 4451020542214504 |
oct | 503051750522155 |
9 | 86544262326131 |
10 | 22202022012013 |
11 | 708a908690628 |
12 | 25a6a98300091 |
13 | c50845a4a78c |
14 | 56a82557783b |
15 | 2877d3a976ad |
hex | 14314fa2a46d |
22202022012013 has 2 divisors, whose sum is σ = 22202022012014. Its totient is φ = 22202022012012.
The previous prime is 22202022012007. The next prime is 22202022012103. The reversal of 22202022012013 is 31021022020222.
Together with next prime (22202022012103) 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., 17176233714084 + 5025788297929 = 4144422^2 + 2241827^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22202022012013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22202022012613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11101011006006 + 11101011006007.
It is an arithmetic number, because the mean of its divisors is an integer number (11101011006007).
Almost surely, 222202022012013 is an apocalyptic number.
It is an amenable number.
22202022012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
22202022012013 is an equidigital number, since it uses as much as digits as its factorization.
22202022012013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 22202022012013 its reverse (31021022020222), we get a palindrome (53223044032235).
The spelling of 22202022012013 in words is "twenty-two trillion, two hundred two billion, twenty-two million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •