Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …101101000101000000111 |
3 | 10221010101121210020101111 |
4 | 100021313311220220013 |
5 | 121142002200023421 |
6 | 2205551203105451 |
7 | 143126420153023 |
oct | 20116765505007 |
9 | 3833347706344 |
10 | 1110112111111 |
11 | 398883389813 |
12 | 15b192372287 |
13 | 808b5a89983 |
14 | 3ba30491383 |
15 | 1dd23606ee1 |
hex | 10277d68a07 |
1110112111111 has 2 divisors, whose sum is σ = 1110112111112. Its totient is φ = 1110112111110.
The previous prime is 1110112111099. The next prime is 1110112111183. The reversal of 1110112111111 is 1111112110111.
It is a weak prime.
It is an emirp because it is prime and its reverse (1111112110111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110112111111 - 215 = 1110112078343 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110112111091 and 1110112111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110112111411) 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, 555056055555 + 555056055556.
It is an arithmetic number, because the mean of its divisors is an integer number (555056055556).
Almost surely, 21110112111111 is an apocalyptic number.
1110112111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110112111111 is an equidigital number, since it uses as much as digits as its factorization.
1110112111111 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 1110112111111 its reverse (1111112110111), we get a palindrome (2221224221222).
The spelling of 1110112111111 in words is "one trillion, one hundred ten billion, one hundred twelve million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •