Base | Representation |
---|---|
bin | 111100001110101… |
… | …0011011101011000 |
3 | 12012211202210012112 |
4 | 1320131103131120 |
5 | 13114330312200 |
6 | 532311531452 |
7 | 101036526044 |
oct | 17035233530 |
9 | 5184683175 |
10 | 2020947800 |
11 | 947854aa3 |
12 | 484989b88 |
13 | 262900001 |
14 | 15258d024 |
15 | bc64e535 |
hex | 78753758 |
2020947800 has 72 divisors (see below), whose sum is σ = 4771999260. Its totient is φ = 795960000.
The previous prime is 2020947793. The next prime is 2020947809. The reversal of 2020947800 is 87490202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020947809) 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 17 ways as a sum of consecutive naturals, for example, 896675 + ... + 898925.
Almost surely, 22020947800 is an apocalyptic number.
2020947800 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 2020947800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2385999630).
2020947800 is an abundant number, since it is smaller than the sum of its proper divisors (2751051460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020947800 is a wasteful number, since it uses less digits than its factorization.
2020947800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2401 (or 2325 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 2020947800 is about 44954.9530085396. The cubic root of 2020947800 is about 1264.3045436003.
The spelling of 2020947800 in words is "two billion, twenty million, nine hundred forty-seven thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •