Base | Representation |
---|---|
bin | 10011110110010011… |
… | …110000110001000000 |
3 | 2001000021202012201000 |
4 | 103312103300301000 |
5 | 322121413313200 |
6 | 13442443212000 |
7 | 1353065043330 |
oct | 236623606100 |
9 | 61007665630 |
10 | 21312244800 |
11 | 904722aa60 |
12 | 4169517000 |
13 | 201850c152 |
14 | 10626b30c0 |
15 | 84b079300 |
hex | 4f64f0c40 |
21312244800 has 1344 divisors, whose sum is σ = 99779328000. Its totient is φ = 4296499200.
The previous prime is 21312244763. The next prime is 21312244819. The reversal of 21312244800 is 844221312.
21312244800 is a `hidden beast` number, since 213 + 1 + 2 + 2 + 448 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (1344).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 143035126 + ... + 143035274.
Almost surely, 221312244800 is an apocalyptic number.
21312244800 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 21312244800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49889664000).
21312244800 is an abundant number, since it is smaller than the sum of its proper divisors (78467083200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21312244800 is a wasteful number, since it uses less digits than its factorization.
21312244800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241 (or 220 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The spelling of 21312244800 in words is "twenty-one billion, three hundred twelve million, two hundred forty-four thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •