Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …001001101111001001101000 |
3 | 112102212102012001112222122011 |
4 | 121002103330021233021220 |
5 | 103413020301033323422 |
6 | 1030103501411005304 |
7 | 32123120513264041 |
oct | 3102237411571150 |
9 | 472772161488564 |
10 | 110110012011112 |
11 | 320a2437244443 |
12 | 10424084299834 |
13 | 4959439115419 |
14 | 1d294d296d8c8 |
15 | cae3328ce077 |
hex | 6424fc26f268 |
110110012011112 has 32 divisors (see below), whose sum is σ = 207194859549000. Its totient is φ = 54858056780800.
The previous prime is 110110012011019. The next prime is 110110012011151. The reversal of 110110012011112 is 211110210011011.
It can be written as a sum of positive squares in 4 ways, for example, as 82493368447396 + 27616643563716 = 9082586^2 + 5255154^2 .
It is a super-2 number, since 2×1101100120111122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110110012011092 and 110110012011101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128042412 + ... + 128899492.
Almost surely, 2110110012011112 is an apocalyptic number.
It is an amenable number.
110110012011112 is a deficient number, since it is larger than the sum of its proper divisors (97084847537888).
110110012011112 is a wasteful number, since it uses less digits than its factorization.
110110012011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 914517 (or 914513 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110110012011112 its reverse (211110210011011), we get a palindrome (321220222022123).
The spelling of 110110012011112 in words is "one hundred ten trillion, one hundred ten billion, twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •