Base | Representation |
---|---|
bin | 1101001000000… |
… | …10110101101011 |
3 | 21200012021102012 |
4 | 12210002311223 |
5 | 211142041412 |
6 | 14532030135 |
7 | 2504636360 |
oct | 644026553 |
9 | 250167365 |
10 | 110112107 |
11 | 57178946 |
12 | 30a6234b |
13 | 19a743c1 |
14 | 108a4467 |
15 | 9a00c22 |
hex | 6902d6b |
110112107 has 8 divisors (see below), whose sum is σ = 126645216. Its totient is φ = 93779712.
The previous prime is 110112089. The next prime is 110112133. The reversal of 110112107 is 701211011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110112107 is a prime.
It is a super-2 number, since 2×1101121072 = 24249352215958898, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110112091 and 110112100.
It is not an unprimeable number, because it can be changed into a prime (110112157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48998 + ... + 51195.
It is an arithmetic number, because the mean of its divisors is an integer number (15830652).
Almost surely, 2110112107 is an apocalyptic number.
110112107 is a deficient number, since it is larger than the sum of its proper divisors (16533109).
110112107 is a wasteful number, since it uses less digits than its factorization.
110112107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100357.
The product of its (nonzero) digits is 14, while the sum is 14.
The square root of 110112107 is about 10493.4316122039. The cubic root of 110112107 is about 479.3047036848.
Adding to 110112107 its reverse (701211011), we get a palindrome (811323118).
The spelling of 110112107 in words is "one hundred ten million, one hundred twelve thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •