Base | Representation |
---|---|
bin | 1010000110011011011010… |
… | …11000110100100111011001 |
3 | 2220122100202112002222011122 |
4 | 11003031231120310213121 |
5 | 10402401323421024004 |
6 | 115123351002535025 |
7 | 4451462016246653 |
oct | 503155530644731 |
9 | 86570675088148 |
10 | 22211111111129 |
11 | 70937521a8296 |
12 | 25a87b4207475 |
13 | c51663ac5935 |
14 | 56b0487436d3 |
15 | 287b669c3cbe |
hex | 14336d6349d9 |
22211111111129 has 2 divisors, whose sum is σ = 22211111111130. Its totient is φ = 22211111111128.
The previous prime is 22211111111081. The next prime is 22211111111171. The reversal of 22211111111129 is 92111111111222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16312527421129 + 5898583690000 = 4038877^2 + 2428700^2 .
It is a cyclic number.
It is not a de Polignac number, because 22211111111129 - 212 = 22211111107033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22211111111098 and 22211111111107.
It is not a weakly prime, because it can be changed into another prime (22211111111179) 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, 11105555555564 + 11105555555565.
It is an arithmetic number, because the mean of its divisors is an integer number (11105555555565).
Almost surely, 222211111111129 is an apocalyptic number.
It is an amenable number.
22211111111129 is a deficient number, since it is larger than the sum of its proper divisors (1).
22211111111129 is an equidigital number, since it uses as much as digits as its factorization.
22211111111129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144, while the sum is 26.
The spelling of 22211111111129 in words is "twenty-two trillion, two hundred eleven billion, one hundred eleven million, one hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •