Base | Representation |
---|---|
bin | 11011100010011000100100… |
… | …100011001010101010100111 |
3 | 120212211000100011200022222211 |
4 | 123202120210203022222213 |
5 | 111333231441324323421 |
6 | 1105325113510104251 |
7 | 34336626130116532 |
oct | 3342304443125247 |
9 | 525730304608884 |
10 | 121110101011111 |
11 | 35653561761373 |
12 | 116bbb4794b087 |
13 | 5276830acb1a4 |
14 | 21c9a8dc71a19 |
15 | e00541cb89e1 |
hex | 6e26248caaa7 |
121110101011111 has 2 divisors, whose sum is σ = 121110101011112. Its totient is φ = 121110101011110.
The previous prime is 121110101011087. The next prime is 121110101011121. The reversal of 121110101011111 is 111110101011121.
It is a strong prime.
It is an emirp because it is prime and its reverse (111110101011121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121110101011111 - 211 = 121110101009063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121110101011091 and 121110101011100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121110101011121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555050505555 + 60555050505556.
It is an arithmetic number, because the mean of its divisors is an integer number (60555050505556).
Almost surely, 2121110101011111 is an apocalyptic number.
121110101011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121110101011111 is an equidigital number, since it uses as much as digits as its factorization.
121110101011111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 121110101011111 its reverse (111110101011121), we get a palindrome (232220202022232).
The spelling of 121110101011111 in words is "one hundred twenty-one trillion, one hundred ten billion, one hundred one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •