Base | Representation |
---|---|
bin | 1001000110101010001011… |
… | …01001101011110101100100 |
3 | 2121212220010222220211110011 |
4 | 10203111011221223311210 |
5 | 10111001440321401040 |
6 | 110325022141540004 |
7 | 4134253352530330 |
oct | 443250551536544 |
9 | 77786128824404 |
10 | 20020011122020 |
11 | 64194913a3208 |
12 | 22b4019274604 |
13 | b22b57083b40 |
14 | 4d2d8bbda7c0 |
15 | 24ab76a9c3ea |
hex | 123545a6bd64 |
20020011122020 has 96 divisors (see below), whose sum is σ = 54787795227648. Its totient is φ = 5963297421312.
The previous prime is 20020011122017. The next prime is 20020011122029. The reversal of 20020011122020 is 2022111002002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (20020011122029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 323498652 + ... + 323560531.
It is an arithmetic number, because the mean of its divisors is an integer number (570706200288).
Almost surely, 220020011122020 is an apocalyptic number.
20020011122020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20020011122020 is an abundant number, since it is smaller than the sum of its proper divisors (34767784105628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020011122020 is a wasteful number, since it uses less digits than its factorization.
20020011122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 647059229 (or 647059227 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20020011122020 its reverse (2022111002002), we get a palindrome (22042122124022).
The spelling of 20020011122020 in words is "twenty trillion, twenty billion, eleven million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •