Base | Representation |
---|---|
bin | 110011010001100101… |
… | …1111110111101111111 |
3 | 101112012220011200100201 |
4 | 1212203023332331333 |
5 | 3301002133310421 |
6 | 122330150304331 |
7 | 10645451433355 |
oct | 1464313767577 |
9 | 345186150321 |
10 | 110112010111 |
11 | 427753a4a54 |
12 | 194103580a7 |
13 | a4ca78718c |
14 | 548801d7d5 |
15 | 2ce6d70b91 |
hex | 19a32fef7f |
110112010111 has 2 divisors, whose sum is σ = 110112010112. Its totient is φ = 110112010110.
The previous prime is 110112010109. The next prime is 110112010117. The reversal of 110112010111 is 111010211011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110112010111 - 21 = 110112010109 is a prime.
Together with 110112010109, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112010117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056005055 + 55056005056.
It is an arithmetic number, because the mean of its divisors is an integer number (55056005056).
Almost surely, 2110112010111 is an apocalyptic number.
110112010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112010111 is an equidigital number, since it uses as much as digits as its factorization.
110112010111 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 10.
Adding to 110112010111 its reverse (111010211011), we get a palindrome (221122221122).
Subtracting 110112010111 from its reverse (111010211011), we obtain a square (898200900 = 299702).
The spelling of 110112010111 in words is "one hundred ten billion, one hundred twelve million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •