Base | Representation |
---|---|
bin | 1010000000010110010100… |
… | …00010110010110001111101 |
3 | 2212220101112222222202222222 |
4 | 11000023022002302301331 |
5 | 10340441012312020104 |
6 | 114443402102415125 |
7 | 4430415221053016 |
oct | 500131202626175 |
9 | 85811488882888 |
10 | 22002212220029 |
11 | 70130a4224538 |
12 | 25742144314a5 |
13 | c37a51c67932 |
14 | 560cac84a00d |
15 | 2824dc1961be |
hex | 1402ca0b2c7d |
22002212220029 has 2 divisors, whose sum is σ = 22002212220030. Its totient is φ = 22002212220028.
The previous prime is 22002212219969. The next prime is 22002212220031. The reversal of 22002212220029 is 92002221220022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13716852955129 + 8285359264900 = 3703627^2 + 2878430^2 .
It is a cyclic number.
It is not a de Polignac number, because 22002212220029 - 224 = 22002195442813 is a prime.
Together with 22002212220031, 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 (22002212220929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11001106110014 + 11001106110015.
It is an arithmetic number, because the mean of its divisors is an integer number (11001106110015).
Almost surely, 222002212220029 is an apocalyptic number.
It is an amenable number.
22002212220029 is a deficient number, since it is larger than the sum of its proper divisors (1).
22002212220029 is an equidigital number, since it uses as much as digits as its factorization.
22002212220029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
The spelling of 22002212220029 in words is "twenty-two trillion, two billion, two hundred twelve million, two hundred twenty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •