Base | Representation |
---|---|
bin | 11001010000110111010110… |
… | …000110100000101010110001 |
3 | 112120102000120222110002011211 |
4 | 121100313112012200222301 |
5 | 104030411441324323441 |
6 | 1032151135321040121 |
7 | 32255303611442242 |
oct | 3120672606405261 |
9 | 476360528402154 |
10 | 111110101011121 |
11 | 32448590428363 |
12 | 10565a70026041 |
13 | 49cc839972994 |
14 | 1d61a86b42cc9 |
15 | cca366d75a81 |
hex | 650dd61a0ab1 |
111110101011121 has 2 divisors, whose sum is σ = 111110101011122. Its totient is φ = 111110101011120.
The previous prime is 111110101011113. The next prime is 111110101011137. The reversal of 111110101011121 is 121110101011111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68784862544896 + 42325238466225 = 8293664^2 + 6505785^2 .
It is an emirp because it is prime and its reverse (121110101011111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111110101011121 - 23 = 111110101011113 is a prime.
It is not a weakly prime, because it can be changed into another prime (111110101017121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555050505560 + 55555050505561.
It is an arithmetic number, because the mean of its divisors is an integer number (55555050505561).
Almost surely, 2111110101011121 is an apocalyptic number.
It is an amenable number.
111110101011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110101011121 is an equidigital number, since it uses as much as digits as its factorization.
111110101011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 111110101011121 its reverse (121110101011111), we get a palindrome (232220202022232).
The spelling of 111110101011121 in words is "one hundred eleven trillion, one hundred ten billion, one hundred one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •