Base | Representation |
---|---|
bin | 10010101110101101… |
… | …011000000111010100 |
3 | 1220220120101122122121 |
4 | 102232231120013110 |
5 | 312141404000040 |
6 | 13123332305324 |
7 | 1311240452056 |
oct | 225655300724 |
9 | 56816348577 |
10 | 20111000020 |
11 | 8590153a81 |
12 | 3a93172244 |
13 | 1b866a0217 |
14 | d8ad3b8d6 |
15 | 7ca894c4a |
hex | 4aeb581d4 |
20111000020 has 24 divisors (see below), whose sum is σ = 42235855200. Its totient is φ = 8043875232.
The previous prime is 20111000003. The next prime is 20111000027. The reversal of 20111000020 is 2000011102.
It is a junction number, because it is equal to n+sod(n) for n = 20110999967 and 20111000012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111000027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 467791 + ... + 508969.
It is an arithmetic number, because the mean of its divisors is an integer number (1759827300).
Almost surely, 220111000020 is an apocalyptic number.
20111000020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20111000020 is an abundant number, since it is smaller than the sum of its proper divisors (22124855180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111000020 is a wasteful number, since it uses less digits than its factorization.
20111000020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65607 (or 65605 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 20111000020 its reverse (2000011102), we get a palindrome (22111011122).
The spelling of 20111000020 in words is "twenty billion, one hundred eleven million, twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •