Base | Representation |
---|---|
bin | 1010000110110100001111… |
… | …1111100001111001010001 |
3 | 1110100022120210111100110001 |
4 | 2201231003333201321101 |
5 | 2424030312101402004 |
6 | 35344514531410001 |
7 | 2224555125034441 |
oct | 241550377417121 |
9 | 43308523440401 |
10 | 11112221122129 |
11 | 35a4737145a46 |
12 | 12b5758453901 |
13 | 627b54b396ba |
14 | 2a5b97734121 |
15 | 1440c37921a4 |
hex | a1b43fe1e51 |
11112221122129 has 2 divisors, whose sum is σ = 11112221122130. Its totient is φ = 11112221122128.
The previous prime is 11112221122031. The next prime is 11112221122139. The reversal of 11112221122129 is 92122112221111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10769554890000 + 342666232129 = 3281700^2 + 585377^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112221122129 - 211 = 11112221120081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11112221122097 and 11112221122106.
It is not a weakly prime, because it can be changed into another prime (11112221122139) 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, 5556110561064 + 5556110561065.
It is an arithmetic number, because the mean of its divisors is an integer number (5556110561065).
Almost surely, 211112221122129 is an apocalyptic number.
It is an amenable number.
11112221122129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112221122129 is an equidigital number, since it uses as much as digits as its factorization.
11112221122129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 576, while the sum is 28.
The spelling of 11112221122129 in words is "eleven trillion, one hundred twelve billion, two hundred twenty-one million, one hundred twenty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •