Base | Representation |
---|---|
bin | 10000001010110010110… |
… | …010000001011111001111 |
3 | 10221012221112121000111202 |
4 | 100022302302001133033 |
5 | 121201013330120421 |
6 | 2210233250540115 |
7 | 143163055561445 |
oct | 20126262013717 |
9 | 3835845530452 |
10 | 1111101020111 |
11 | 399240617785 |
12 | 15b40959763b |
13 | 80a12912824 |
14 | 3bac5952b95 |
15 | 1dd8034710b |
hex | 102b2c817cf |
1111101020111 has 2 divisors, whose sum is σ = 1111101020112. Its totient is φ = 1111101020110.
The previous prime is 1111101020047. The next prime is 1111101020131. The reversal of 1111101020111 is 1110201011111.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1110201011111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1111101020111 - 26 = 1111101020047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111101020092 and 1111101020101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111101020131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555550510055 + 555550510056.
It is an arithmetic number, because the mean of its divisors is an integer number (555550510056).
Almost surely, 21111101020111 is an apocalyptic number.
1111101020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111101020111 is an equidigital number, since it uses as much as digits as its factorization.
1111101020111 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 11.
Adding to 1111101020111 its reverse (1110201011111), we get a palindrome (2221302031222).
The spelling of 1111101020111 in words is "one trillion, one hundred eleven billion, one hundred one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •