Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …101100111101010111001011 |
3 | 112102212111202200111222002021 |
4 | 121002110313230331113023 |
5 | 103413024322320200412 |
6 | 1030104144500545311 |
7 | 32123154334351663 |
oct | 3102246754752713 |
9 | 472774680458067 |
10 | 110111011100107 |
11 | 320a28aa1a5826 |
12 | 104243029b2237 |
13 | 49595680c3a44 |
14 | 1d295895211a3 |
15 | cae390480607 |
hex | 642537b3d5cb |
110111011100107 has 2 divisors, whose sum is σ = 110111011100108. Its totient is φ = 110111011100106.
The previous prime is 110111011100071. The next prime is 110111011100117. The reversal of 110111011100107 is 701001110111011.
Together with previous prime (110111011100071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111011100107 - 27 = 110111011099979 is a prime.
It is a super-2 number, since 2×1101110111001072 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110111011100117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055505550053 + 55055505550054.
It is an arithmetic number, because the mean of its divisors is an integer number (55055505550054).
Almost surely, 2110111011100107 is an apocalyptic number.
110111011100107 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111011100107 is an equidigital number, since it uses as much as digits as its factorization.
110111011100107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 16.
Adding to 110111011100107 its reverse (701001110111011), we get a palindrome (811112121211118).
The spelling of 110111011100107 in words is "one hundred ten trillion, one hundred eleven billion, eleven million, one hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •