Base | Representation |
---|---|
bin | 10100010100110111… |
… | …101000010110100000 |
3 | 2002100000112001020000 |
4 | 110110313220112200 |
5 | 324144142322000 |
6 | 14005400420000 |
7 | 1401562063440 |
oct | 242467502640 |
9 | 62300461200 |
10 | 21824964000 |
11 | 928a694534 |
12 | 4291177600 |
13 | 209a7c86a8 |
14 | 10b081a120 |
15 | 87b0a6000 |
hex | 514de85a0 |
21824964000 has 480 divisors, whose sum is σ = 91557962496. Its totient is φ = 4988044800.
The previous prime is 21824963939. The next prime is 21824964047. The reversal of 21824964000 is 46942812.
21824964000 is a `hidden beast` number, since 2 + 1 + 8 + 2 + 4 + 9 + 640 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2263189 + ... + 2272811.
Almost surely, 221824964000 is an apocalyptic number.
21824964000 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 21824964000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45778981248).
21824964000 is an abundant number, since it is smaller than the sum of its proper divisors (69732998496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21824964000 is an equidigital number, since it uses as much as digits as its factorization.
21824964000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9667 (or 9640 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 21824964000 in words is "twenty-one billion, eight hundred twenty-four million, nine hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •