Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …11010110100011010011110 |
3 | 2121211000001000211012112200 |
4 | 10203002221122310122132 |
5 | 10110140412242010420 |
6 | 110311545241312330 |
7 | 4132652564644536 |
oct | 443025132643236 |
9 | 77730030735480 |
10 | 20000210110110 |
11 | 641105022595a |
12 | 22b0211a956a6 |
13 | b2101c99aa49 |
14 | 4d20301124c6 |
15 | 24a3b853ab90 |
hex | 1230a96b469e |
20000210110110 has 96 divisors (see below), whose sum is σ = 54018748368000. Its totient is φ = 5127933285888.
The previous prime is 20000210110109. The next prime is 20000210110121. The reversal of 20000210110110 is 1101101200002.
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 = 20000210110092 and 20000210110101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15407415 + ... + 16654994.
It is an arithmetic number, because the mean of its divisors is an integer number (562695295500).
Almost surely, 220000210110110 is an apocalyptic number.
20000210110110 is an abundant number, since it is smaller than the sum of its proper divisors (34018538257890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000210110110 is a wasteful number, since it uses less digits than its factorization.
20000210110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32062690 (or 32062687 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20000210110110 its reverse (1101101200002), we get a palindrome (21101311310112).
The spelling of 20000210110110 in words is "twenty trillion, two hundred ten million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •