Base | Representation |
---|---|
bin | 1010000110001011011110… |
… | …10110000011001111001101 |
3 | 2220121112200011101220112212 |
4 | 11003011233112003033031 |
5 | 10402231312311120204 |
6 | 115115413522240205 |
7 | 4451036662116011 |
oct | 503055726031715 |
9 | 86545604356485 |
10 | 22202554004429 |
11 | 7090060a09387 |
12 | 25a70064b6065 |
13 | c508cc0246a6 |
14 | 56a87609a541 |
15 | 28781562ec6e |
hex | 14316f5833cd |
22202554004429 has 2 divisors, whose sum is σ = 22202554004430. Its totient is φ = 22202554004428.
The previous prime is 22202554004387. The next prime is 22202554004431. The reversal of 22202554004429 is 92440045520222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13882502201929 + 8320051802500 = 3725923^2 + 2884450^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22202554004429 is a prime.
Together with 22202554004431, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22202554034429) 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, 11101277002214 + 11101277002215.
It is an arithmetic number, because the mean of its divisors is an integer number (11101277002215).
Almost surely, 222202554004429 is an apocalyptic number.
It is an amenable number.
22202554004429 is a deficient number, since it is larger than the sum of its proper divisors (1).
22202554004429 is an equidigital number, since it uses as much as digits as its factorization.
22202554004429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 460800, while the sum is 41.
The spelling of 22202554004429 in words is "twenty-two trillion, two hundred two billion, five hundred fifty-four million, four thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •