Base | Representation |
---|---|
bin | 10010101110110001… |
… | …001100011111111100 |
3 | 1220220122021111202200 |
4 | 102232301030133330 |
5 | 312142133013040 |
6 | 13123405551500 |
7 | 1311252121326 |
oct | 225661143774 |
9 | 56818244680 |
10 | 20112001020 |
11 | 8590778051 |
12 | 3a93575590 |
13 | 1b86960a27 |
14 | d8b11c616 |
15 | 7ca9e1630 |
hex | 4aec4c7fc |
20112001020 has 72 divisors (see below), whose sum is σ = 61865687520. Its totient is φ = 5287658880.
The previous prime is 20112001009. The next prime is 20112001031. The reversal of 20112001020 is 2010021102.
It is an interprime number because it is at equal distance from previous prime (20112001009) and next prime (20112001031).
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 = 20112000993 and 20112001011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 774075 + ... + 799634.
It is an arithmetic number, because the mean of its divisors is an integer number (859245660).
Almost surely, 220112001020 is an apocalyptic number.
20112001020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112001020 is an abundant number, since it is smaller than the sum of its proper divisors (41753686500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112001020 is a wasteful number, since it uses less digits than its factorization.
20112001020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1573795 (or 1573790 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20112001020 its reverse (2010021102), we get a palindrome (22122022122).
The spelling of 20112001020 in words is "twenty billion, one hundred twelve million, one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •