Base | Representation |
---|---|
bin | 1010000000010100011110… |
… | …00010001101000111101101 |
3 | 2212220022000000010001120221 |
4 | 11000022033002031013231 |
5 | 10340432000341210104 |
6 | 114443115535211341 |
7 | 4430351540110336 |
oct | 500121702150755 |
9 | 85808000101527 |
10 | 22001222210029 |
11 | 7012736404357 |
12 | 2573b98976b51 |
13 | c37924b178ba |
14 | 560c1717d28d |
15 | 2824802d9c54 |
hex | 14028f08d1ed |
22001222210029 has 2 divisors, whose sum is σ = 22001222210030. Its totient is φ = 22001222210028.
The previous prime is 22001222209943. The next prime is 22001222210057. The reversal of 22001222210029 is 92001222210022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21851838414025 + 149383796004 = 4674595^2 + 386502^2 .
It is a cyclic number.
It is not a de Polignac number, because 22001222210029 - 229 = 22000685339117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22001222209985 and 22001222210012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22001222210059) 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, 11000611105014 + 11000611105015.
It is an arithmetic number, because the mean of its divisors is an integer number (11000611105015).
Almost surely, 222001222210029 is an apocalyptic number.
It is an amenable number.
22001222210029 is a deficient number, since it is larger than the sum of its proper divisors (1).
22001222210029 is an equidigital number, since it uses as much as digits as its factorization.
22001222210029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The spelling of 22001222210029 in words is "twenty-two trillion, one billion, two hundred twenty-two million, two hundred ten thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •