Base | Representation |
---|---|
bin | 1010001100000011000111… |
… | …1010111001111010100001 |
3 | 1110122220121110110220221011 |
4 | 2203000301322321322201 |
5 | 2432013411212424441 |
6 | 35454102422100521 |
7 | 2234216532624355 |
oct | 243006172717241 |
9 | 43586543426834 |
10 | 11202112233121 |
11 | 3629875354117 |
12 | 130b06487a741 |
13 | 63347c2251c4 |
14 | 2aa283da9465 |
15 | 1465d52b0581 |
hex | a3031eb9ea1 |
11202112233121 has 2 divisors, whose sum is σ = 11202112233122. Its totient is φ = 11202112233120.
The previous prime is 11202112233077. The next prime is 11202112233131. The reversal of 11202112233121 is 12133221120211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10751185210000 + 450927023121 = 3278900^2 + 671511^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202112233121 - 225 = 11202078678689 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11202112233092 and 11202112233101.
It is not a weakly prime, because it can be changed into another prime (11202112233131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601056116560 + 5601056116561.
It is an arithmetic number, because the mean of its divisors is an integer number (5601056116561).
Almost surely, 211202112233121 is an apocalyptic number.
It is an amenable number.
11202112233121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202112233121 is an equidigital number, since it uses as much as digits as its factorization.
11202112233121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11202112233121 its reverse (12133221120211), we get a palindrome (23335333353332).
The spelling of 11202112233121 in words is "eleven trillion, two hundred two billion, one hundred twelve million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •