Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …001001010011011100110 |
3 | 21010011110000121121222000 |
4 | 131100003321022123212 |
5 | 230413201130323420 |
6 | 4135233133350130 |
7 | 265140254116065 |
oct | 35200371123346 |
9 | 7104400547860 |
10 | 2010110011110 |
11 | 705534774873 |
12 | 2856a5938346 |
13 | 117724c8bc76 |
14 | 6d40b48c1dc |
15 | 3744a86b690 |
hex | 1d403e4a6e6 |
2010110011110 has 64 divisors (see below), whose sum is σ = 5360798324160. Its totient is φ = 535978840320.
The previous prime is 2010110011109. The next prime is 2010110011183. The reversal of 2010110011110 is 111100110102.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2010110011092 and 2010110011101.
It is a congruent number.
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, 2565594 + ... + 3256146.
It is an arithmetic number, because the mean of its divisors is an integer number (83762473815).
Almost surely, 22010110011110 is an apocalyptic number.
2010110011110 is an abundant number, since it is smaller than the sum of its proper divisors (3350688313050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010110011110 is a wasteful number, since it uses less digits than its factorization.
2010110011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 701350 (or 701344 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2010110011110 its reverse (111100110102), we get a palindrome (2121210121212).
The spelling of 2010110011110 in words is "two trillion, ten billion, one hundred ten million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •