Base | Representation |
---|---|
bin | 1010000011110101011100… |
… | …00101010101110101010001 |
3 | 2220022211202100222210001222 |
4 | 11001322232011111311101 |
5 | 10344421330031211004 |
6 | 115014412453534425 |
7 | 4442155560140453 |
oct | 501725605256521 |
9 | 86284670883058 |
10 | 22122002210129 |
11 | 705998558a058 |
12 | 2593485944415 |
13 | c461327a1793 |
14 | 5669d3d262d3 |
15 | 28569d9b67be |
hex | 141eae155d51 |
22122002210129 has 2 divisors, whose sum is σ = 22122002210130. Its totient is φ = 22122002210128.
The previous prime is 22122002210117. The next prime is 22122002210141. The reversal of 22122002210129 is 92101220022122.
It is a balanced prime because it is at equal distance from previous prime (22122002210117) and next prime (22122002210141).
It can be written as a sum of positive squares in only one way, i.e., 14985624250129 + 7136377960000 = 3871127^2 + 2671400^2 .
It is a cyclic number.
It is not a de Polignac number, because 22122002210129 - 220 = 22122001161553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22122002210098 and 22122002210107.
It is not a weakly prime, because it can be changed into another prime (22122002210729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11061001105064 + 11061001105065.
It is an arithmetic number, because the mean of its divisors is an integer number (11061001105065).
Almost surely, 222122002210129 is an apocalyptic number.
It is an amenable number.
22122002210129 is a deficient number, since it is larger than the sum of its proper divisors (1).
22122002210129 is an equidigital number, since it uses as much as digits as its factorization.
22122002210129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 22122002210129 in words is "twenty-two trillion, one hundred twenty-two billion, two million, two hundred ten thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •