Base | Representation |
---|---|
bin | 11101010001000000000… |
… | …101111101110001101110 |
3 | 21010021001102002101102000 |
4 | 131101000011331301232 |
5 | 230422233210000420 |
6 | 4135521253113130 |
7 | 265204266642324 |
oct | 35210005756156 |
9 | 7107042071360 |
10 | 2011120000110 |
11 | 705a028a0521 |
12 | 2859280287a6 |
13 | 1178562b59b0 |
14 | 6d4a5679d14 |
15 | 374a9372690 |
hex | 1d44017dc6e |
2011120000110 has 128 divisors (see below), whose sum is σ = 5817682604160. Its totient is φ = 491431339008.
The previous prime is 2011120000061. The next prime is 2011120000111. The reversal of 2011120000110 is 110000211102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2011120000092 and 2011120000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011120000111) 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, 1610257 + ... + 2571996.
It is an arithmetic number, because the mean of its divisors is an integer number (45450645345).
Almost surely, 22011120000110 is an apocalyptic number.
2011120000110 is an abundant number, since it is smaller than the sum of its proper divisors (3806562604050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011120000110 is a wasteful number, since it uses less digits than its factorization.
2011120000110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4182419 (or 4182413 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2011120000110 its reverse (110000211102), we get a palindrome (2121120211212).
The spelling of 2011120000110 in words is "two trillion, eleven billion, one hundred twenty million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •