Base | Representation |
---|---|
bin | 1001000110101100000001… |
… | …00110011000000000011110 |
3 | 2121212222200220212122001200 |
4 | 10203112000212120000132 |
5 | 10111011002012010420 |
6 | 110325304231220330 |
7 | 4134320022015456 |
oct | 443260046300036 |
9 | 77788626778050 |
10 | 20021000110110 |
11 | 641994968563a |
12 | 22b42545176a6 |
13 | b22c83c369ac |
14 | 4d30432bcd66 |
15 | 24abd3805b90 |
hex | 12358099801e |
20021000110110 has 72 divisors (see below), whose sum is σ = 55296755393256. Its totient is φ = 5024878452480.
The previous prime is 20021000110073. The next prime is 20021000110117. The reversal of 20021000110110 is 1101100012002.
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 = 20021000110092 and 20021000110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021000110117) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 384845196 + ... + 384897215.
It is an arithmetic number, because the mean of its divisors is an integer number (768010491573).
Almost surely, 220021000110110 is an apocalyptic number.
20021000110110 is an abundant number, since it is smaller than the sum of its proper divisors (35275755283146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021000110110 is a wasteful number, since it uses less digits than its factorization.
20021000110110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 769742458 (or 769742438 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20021000110110 its reverse (1101100012002), we get a palindrome (21122100122112).
The spelling of 20021000110110 in words is "twenty trillion, twenty-one billion, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •