Base | Representation |
---|---|
bin | 10010101110000100… |
… | …001110000110100110 |
3 | 1220212211002112001100 |
4 | 102232010032012212 |
5 | 312131123223420 |
6 | 13122305140530 |
7 | 1311046655400 |
oct | 225604160646 |
9 | 56784075040 |
10 | 20100211110 |
11 | 8585055121 |
12 | 3a8b62a746 |
13 | 1b84393555 |
14 | d8972db70 |
15 | 7c9963190 |
hex | 4ae10e1a6 |
20100211110 has 144 divisors (see below), whose sum is σ = 62207258256. Its totient is φ = 4487446656.
The previous prime is 20100211099. The next prime is 20100211139. The reversal of 20100211110 is 1111200102.
It is a happy number.
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 = 20100211092 and 20100211101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 136632 + ... + 242628.
It is an arithmetic number, because the mean of its divisors is an integer number (431994849).
Almost surely, 220100211110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20100211110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31103629128).
20100211110 is an abundant number, since it is smaller than the sum of its proper divisors (42107047146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20100211110 is a wasteful number, since it uses less digits than its factorization.
20100211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106067 (or 106057 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20100211110 its reverse (1111200102), we get a palindrome (21211411212).
The spelling of 20100211110 in words is "twenty billion, one hundred million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.362 sec. • engine limits •