Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1011100001011100111111 |
3 | 1022210121112201012101120002 |
4 | 2103020231023201130333 |
5 | 2311130023404310421 |
6 | 33300551423344515 |
7 | 2062334520345266 |
oct | 223105513413477 |
9 | 38717481171502 |
10 | 10111111010111 |
11 | 3249109629501 |
12 | 117372675213b |
13 | 58462088c657 |
14 | 26d547ab95dd |
15 | 12802e848b0b |
hex | 9322d2e173f |
10111111010111 has 2 divisors, whose sum is σ = 10111111010112. Its totient is φ = 10111111010110.
The previous prime is 10111111010093. The next prime is 10111111010123. The reversal of 10111111010111 is 11101011111101.
It is a strong prime.
It is an emirp because it is prime and its reverse (11101011111101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10111111010111 - 214 = 10111110993727 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111111010092 and 10111111010101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111111010131) 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, 5055555505055 + 5055555505056.
It is an arithmetic number, because the mean of its divisors is an integer number (5055555505056).
Almost surely, 210111111010111 is an apocalyptic number.
10111111010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111111010111 is an equidigital number, since it uses as much as digits as its factorization.
10111111010111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 10111111010111 its reverse (11101011111101), we get a palindrome (21212122121212).
The spelling of 10111111010111 in words is "ten trillion, one hundred eleven billion, one hundred eleven million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •