Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …00110100010001001100110 |
3 | 2121212220200112222111102010 |
4 | 10203111102012202021212 |
5 | 10111002402310323420 |
6 | 110325055003055050 |
7 | 4134261500206404 |
oct | 443252206421146 |
9 | 77786615874363 |
10 | 20020220011110 |
11 | 64195892a7720 |
12 | 22b4077211486 |
13 | b22b8b431157 |
14 | 4d2dab854474 |
15 | 24ab8a0b04e0 |
hex | 1235521a2266 |
20020220011110 has 128 divisors (see below), whose sum is σ = 52939901058048. Its totient is φ = 4804938560000.
The previous prime is 20020220011037. The next prime is 20020220011117. The reversal of 20020220011110 is 1111002202002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020220011117) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 727280167 + ... + 727307693.
It is an arithmetic number, because the mean of its divisors is an integer number (413592977016).
Almost surely, 220020220011110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20020220011110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26469950529024).
20020220011110 is an abundant number, since it is smaller than the sum of its proper divisors (32919681046938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020220011110 is a wasteful number, since it uses less digits than its factorization.
20020220011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49470.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20020220011110 its reverse (1111002202002), we get a palindrome (21131222213112).
The spelling of 20020220011110 in words is "twenty trillion, twenty billion, two hundred twenty million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •