Base | Representation |
---|---|
bin | 1001000110000101000101… |
… | …11011010111010011010110 |
3 | 2121210222202102220001111000 |
4 | 10203002202323113103112 |
5 | 10110140201401413420 |
6 | 110311530351124130 |
7 | 4132650103145562 |
oct | 443024273272326 |
9 | 77728672801430 |
10 | 20000101201110 |
11 | 6410aa47a9a18 |
12 | 22b01a1513646 |
13 | b21003258154 |
14 | 4d201d8826a2 |
15 | 24a3adbc6690 |
hex | 1230a2ed74d6 |
20000101201110 has 32 divisors (see below), whose sum is σ = 53333603203680. Its totient is φ = 5333360320224.
The previous prime is 20000101201057. The next prime is 20000101201111. The reversal of 20000101201110 is 1110210100002.
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 = 20000101201092 and 20000101201101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000101201111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37037224177 + ... + 37037224716.
It is an arithmetic number, because the mean of its divisors is an integer number (1666675100115).
Almost surely, 220000101201110 is an apocalyptic number.
20000101201110 is an abundant number, since it is smaller than the sum of its proper divisors (33333502002570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000101201110 is a wasteful number, since it uses less digits than its factorization.
20000101201110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74074448909 (or 74074448903 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20000101201110 its reverse (1110210100002), we get a palindrome (21110311301112).
The spelling of 20000101201110 in words is "twenty trillion, one hundred one million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •