Base | Representation |
---|---|
bin | 10010110101001110… |
… | …00000110110000101 |
3 | 222002120221212011121 |
4 | 21122213000312011 |
5 | 131201142023414 |
6 | 4351114433541 |
7 | 505352345410 |
oct | 113247006605 |
9 | 28076855147 |
10 | 10110111109 |
11 | 431899212a |
12 | 1b61a328b1 |
13 | c51761287 |
14 | 6bca26b77 |
15 | 3e28ad724 |
hex | 25a9c0d85 |
10110111109 has 64 divisors (see below), whose sum is σ = 13158604800. Its totient is φ = 7571708928.
The previous prime is 10110111107. The next prime is 10110111197. The reversal of 10110111109 is 90111101101.
It is not a de Polignac number, because 10110111109 - 21 = 10110111107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10110111092 and 10110111101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110111103) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7794349 + ... + 7795645.
It is an arithmetic number, because the mean of its divisors is an integer number (205603200).
Almost surely, 210110111109 is an apocalyptic number.
10110111109 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10110111109 is a deficient number, since it is larger than the sum of its proper divisors (3048493691).
10110111109 is a wasteful number, since it uses less digits than its factorization.
10110111109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1442.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 10110111109 in words is "ten billion, one hundred ten million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •