Base | Representation |
---|---|
bin | 11110101101001100010… |
… | …111001110101010010000 |
3 | 21110201120012102111022002 |
4 | 132231030113032222100 |
5 | 234033001141200422 |
6 | 4253212102333132 |
7 | 305310331625060 |
oct | 36551427165220 |
9 | 7421505374262 |
10 | 2110110100112 |
11 | 743990160823 |
12 | 2a0b5372a1a8 |
13 | 123ca0800071 |
14 | 741b65333a0 |
15 | 39d4eac2692 |
hex | 1eb4c5cea90 |
2110110100112 has 160 divisors (see below), whose sum is σ = 5033651040000. Its totient is φ = 836284022784.
The previous prime is 2110110100103. The next prime is 2110110100127. The reversal of 2110110100112 is 2110010110112.
It is a junction number, because it is equal to n+sod(n) for n = 2110110100093 and 2110110100102.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 308808248 + ... + 308815080.
It is an arithmetic number, because the mean of its divisors is an integer number (31460319000).
Almost surely, 22110110100112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2110110100112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2516825520000).
2110110100112 is an abundant number, since it is smaller than the sum of its proper divisors (2923540939888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110110100112 is a wasteful number, since it uses less digits than its factorization.
2110110100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9673 (or 9667 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2110110100112 its reverse (2110010110112), we get a palindrome (4220120210224).
The spelling of 2110110100112 in words is "two trillion, one hundred ten billion, one hundred ten million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •