Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …010100111111000111101111 |
3 | 112102212121121102021011121122 |
4 | 121002111321110333013233 |
5 | 103413034101200041421 |
6 | 1030104450031251155 |
7 | 32123223533661344 |
oct | 3102257124770757 |
9 | 472777542234548 |
10 | 110112112112111 |
11 | 320a33147413aa |
12 | 1042456b679abb |
13 | 49596b223a235 |
14 | 1d296518447cb |
15 | cae406e662ab |
hex | 64257953f1ef |
110112112112111 has 2 divisors, whose sum is σ = 110112112112112. Its totient is φ = 110112112112110.
The previous prime is 110112112112071. The next prime is 110112112112113. The reversal of 110112112112111 is 111211211211011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110112112112111 - 230 = 110111038370287 is a prime.
Together with 110112112112113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110112112112111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112112112113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056056056055 + 55056056056056.
It is an arithmetic number, because the mean of its divisors is an integer number (55056056056056).
Almost surely, 2110112112112111 is an apocalyptic number.
110112112112111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112112112111 is an equidigital number, since it uses as much as digits as its factorization.
110112112112111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 17.
Adding to 110112112112111 its reverse (111211211211011), we get a palindrome (221323323323122).
The spelling of 110112112112111 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twelve million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •