Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111011100110011010101001 |
3 | 112102110220020010201212022010 |
4 | 121000231132323212122221 |
5 | 103404220000011200014 |
6 | 1025541145153550133 |
7 | 32112144355414245 |
oct | 3100553673463251 |
9 | 472426203655263 |
10 | 110000000100009 |
11 | 3205a8133a9348 |
12 | 104068a1575349 |
13 | 494bc56307b36 |
14 | 1d24057d69425 |
15 | cab544732359 |
hex | 640b5eee66a9 |
110000000100009 has 32 divisors (see below), whose sum is σ = 156038948553600. Its totient is φ = 68689177804800.
The previous prime is 110000000099989. The next prime is 110000000100019. The reversal of 110000000100009 is 900001000000011.
It is not a de Polignac number, because 110000000100009 - 29 = 110000000099497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110000000099967 and 110000000100003.
It is not an unprimeable number, because it can be changed into a prime (110000000100019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6890217 + ... + 16354665.
It is an arithmetic number, because the mean of its divisors is an integer number (4876217142300).
Almost surely, 2110000000100009 is an apocalyptic number.
It is an amenable number.
110000000100009 is a deficient number, since it is larger than the sum of its proper divisors (46038948453591).
110000000100009 is a wasteful number, since it uses less digits than its factorization.
110000000100009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9465561.
The product of its (nonzero) digits is 9, while the sum is 12.
The spelling of 110000000100009 in words is "one hundred ten trillion, one hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •