Base | Representation |
---|---|
bin | 1010000110011001100010… |
… | …10000001000111100010001 |
3 | 2220122021011012200002012122 |
4 | 11003030301100020330101 |
5 | 10402342242130432004 |
6 | 115123102522304025 |
7 | 4451425015542212 |
oct | 503146120107421 |
9 | 86567135602178 |
10 | 22210102202129 |
11 | 7093284749aa6 |
12 | 25a8572358015 |
13 | c51532a8966a |
14 | 56ad90757409 |
15 | 287b08132cbe |
hex | 143331408f11 |
22210102202129 has 2 divisors, whose sum is σ = 22210102202130. Its totient is φ = 22210102202128.
The previous prime is 22210102202111. The next prime is 22210102202137. The reversal of 22210102202129 is 92120220101222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21537702202129 + 672400000000 = 4640873^2 + 820000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22210102202129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22210102202098 and 22210102202107.
It is not a weakly prime, because it can be changed into another prime (22210102202929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11105051101064 + 11105051101065.
It is an arithmetic number, because the mean of its divisors is an integer number (11105051101065).
Almost surely, 222210102202129 is an apocalyptic number.
It is an amenable number.
22210102202129 is a deficient number, since it is larger than the sum of its proper divisors (1).
22210102202129 is an equidigital number, since it uses as much as digits as its factorization.
22210102202129 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 26.
The spelling of 22210102202129 in words is "twenty-two trillion, two hundred ten billion, one hundred two million, two hundred two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •