Base | Representation |
---|---|
bin | 100111011010… |
… | …1000111100000 |
3 | 1102212212202222 |
4 | 1032311013200 |
5 | 20242233200 |
6 | 2014530212 |
7 | 340435142 |
oct | 116650740 |
9 | 42785688 |
10 | 20664800 |
11 | 10734852 |
12 | 6b06968 |
13 | 4386bc0 |
14 | 2a5cc92 |
15 | 1c32d85 |
hex | 13b51e0 |
20664800 has 72 divisors (see below), whose sum is σ = 54355896. Its totient is φ = 7626240.
The previous prime is 20664793. The next prime is 20664823. The reversal of 20664800 is 846602.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 20664800.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9407 + ... + 11393.
It is an arithmetic number, because the mean of its divisors is an integer number (754943).
Almost surely, 220664800 is an apocalyptic number.
20664800 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 20664800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27177948).
20664800 is an abundant number, since it is smaller than the sum of its proper divisors (33691096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20664800 is a wasteful number, since it uses less digits than its factorization.
20664800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2020 (or 2007 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 20664800 is about 4545.8552550648. The cubic root of 20664800 is about 274.4166145198.
The spelling of 20664800 in words is "twenty million, six hundred sixty-four thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •