Base | Representation |
---|---|
bin | 110011010001100100… |
… | …0001010110101000001 |
3 | 101112012211021212121202 |
4 | 1212203020022311001 |
5 | 3301001404310423 |
6 | 122330113030545 |
7 | 10645440100046 |
oct | 1464310126501 |
9 | 345184255552 |
10 | 110111010113 |
11 | 42774881705 |
12 | 1940bb55455 |
13 | a4ca4c6c70 |
14 | 5487c3d1cd |
15 | 2ce6c24728 |
hex | 19a320ad41 |
110111010113 has 16 divisors (see below), whose sum is σ = 123532214400. Its totient is φ = 97481147520.
The previous prime is 110111010109. The next prime is 110111010157. The reversal of 110111010113 is 311010111011.
It is a cyclic number.
It is not a de Polignac number, because 110111010113 - 22 = 110111010109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110111010094 and 110111010103.
It is not an unprimeable number, because it can be changed into a prime (110111010173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1719293 + ... + 1782186.
It is an arithmetic number, because the mean of its divisors is an integer number (7720763400).
Almost surely, 2110111010113 is an apocalyptic number.
110111010113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110111010113 is a deficient number, since it is larger than the sum of its proper divisors (13421204287).
110111010113 is a wasteful number, since it uses less digits than its factorization.
110111010113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3501592.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 110111010113 its reverse (311010111011), we get a palindrome (421121121124).
The spelling of 110111010113 in words is "one hundred ten billion, one hundred eleven million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •