Base | Representation |
---|---|
bin | 10011001000110010… |
… | …100001110111011100 |
3 | 1222001001201220202211 |
4 | 103020302201313130 |
5 | 314040412331200 |
6 | 13235002530204 |
7 | 1325132602144 |
oct | 231062416734 |
9 | 58031656684 |
10 | 20548558300 |
11 | 8795141a96 |
12 | 3b95806964 |
13 | 1c26231b4a |
14 | dcd0bb924 |
15 | 803ec6aba |
hex | 4c8ca1ddc |
20548558300 has 72 divisors (see below), whose sum is σ = 45876935216. Its totient is φ = 7985640960.
The previous prime is 20548558297. The next prime is 20548558319. The reversal of 20548558300 is 385584502.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 468094 + ... + 510106.
Almost surely, 220548558300 is an apocalyptic number.
20548558300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20548558300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22938467608).
20548558300 is an abundant number, since it is smaller than the sum of its proper divisors (25328376916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20548558300 is a wasteful number, since it uses less digits than its factorization.
20548558300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42167 (or 42160 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 40.
The spelling of 20548558300 in words is "twenty billion, five hundred forty-eight million, five hundred fifty-eight thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •