Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …000100010000010011101 |
3 | 10221010010111212001022121 |
4 | 100021301300202002131 |
5 | 121141300042010414 |
6 | 2205533120542541 |
7 | 143124041155015 |
oct | 20116160420235 |
9 | 3833114761277 |
10 | 1110010110109 |
11 | 39883085096a |
12 | 15b164181a51 |
13 | 8089a8c5454 |
14 | 3ba20adcc45 |
15 | 1dd196a9724 |
hex | 10271c2209d |
1110010110109 has 8 divisors (see below), whose sum is σ = 1126350712760. Its totient is φ = 1093769450496.
The previous prime is 1110010110043. The next prime is 1110010110173. The reversal of 1110010110109 is 9010110100111.
It can be written as a sum of positive squares in 4 ways, for example, as 218490804900 + 891519305209 = 467430^2 + 944203^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1110010110109 - 29 = 1110010109597 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110010110092 and 1110010110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110010110709) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24963384 + ... + 25007809.
It is an arithmetic number, because the mean of its divisors is an integer number (140793839095).
Almost surely, 21110010110109 is an apocalyptic number.
It is an amenable number.
1110010110109 is a deficient number, since it is larger than the sum of its proper divisors (16340602651).
1110010110109 is an equidigital number, since it uses as much as digits as its factorization.
1110010110109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49971519.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 1110010110109 in words is "one trillion, one hundred ten billion, ten million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •