Base | Representation |
---|---|
bin | 110011010001100110… |
… | …0000001111001011111 |
3 | 101112012220012021211011 |
4 | 1212203030001321133 |
5 | 3301002134201421 |
6 | 122330150440051 |
7 | 10645451513350 |
oct | 1464314017137 |
9 | 345186167734 |
10 | 110112022111 |
11 | 42775402a73 |
12 | 19410363027 |
13 | a4ca78c790 |
14 | 5488023d27 |
15 | 2ce6d744e1 |
hex | 19a3301e5f |
110112022111 has 16 divisors (see below), whose sum is σ = 135530296384. Its totient is φ = 87116580864.
The previous prime is 110112022093. The next prime is 110112022147. The reversal of 110112022111 is 111220211011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110112022111 - 29 = 110112021599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 110112022091 and 110112022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110112022171) 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 in 15 ways as a sum of consecutive naturals, for example, 2952895 + ... + 2989951.
It is an arithmetic number, because the mean of its divisors is an integer number (8470643524).
Almost surely, 2110112022111 is an apocalyptic number.
110112022111 is a deficient number, since it is larger than the sum of its proper divisors (25418274273).
110112022111 is a wasteful number, since it uses less digits than its factorization.
110112022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69730.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110112022111 its reverse (111220211011), we get a palindrome (221332233122).
The spelling of 110112022111 in words is "one hundred ten billion, one hundred twelve million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •