Base | Representation |
---|---|
bin | 11101000110110101110… |
… | …111110100000111001110 |
3 | 21002012220011001211212200 |
4 | 131012311313310013032 |
5 | 230232413020200420 |
6 | 4130515001342330 |
7 | 264340044553206 |
oct | 35066567640716 |
9 | 7065804054780 |
10 | 2000211100110 |
11 | 701315025493 |
12 | 2837a27979a6 |
13 | 116808206b92 |
14 | 6cb4c921406 |
15 | 3706b7cab90 |
hex | 1d1b5df41ce |
2000211100110 has 48 divisors (see below), whose sum is σ = 5203177190640. Its totient is φ = 533120054400.
The previous prime is 2000211100093. The next prime is 2000211100133. The reversal of 2000211100110 is 110011120002.
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 = 2000211100092 and 2000211100101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5436991 + ... + 5793210.
It is an arithmetic number, because the mean of its divisors is an integer number (108399524805).
Almost surely, 22000211100110 is an apocalyptic number.
2000211100110 is an abundant number, since it is smaller than the sum of its proper divisors (3202966090530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000211100110 is a wasteful number, since it uses less digits than its factorization.
2000211100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11232193 (or 11232190 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2000211100110 its reverse (110011120002), we get a palindrome (2110222220112).
The spelling of 2000211100110 in words is "two trillion, two hundred eleven million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •