Base | Representation |
---|---|
bin | 10100011011010101… |
… | …101011011000000000 |
3 | 2002121120202110010000 |
4 | 110123111223120000 |
5 | 324404434112000 |
6 | 14024235040000 |
7 | 1404350464542 |
oct | 243325533000 |
9 | 62546673100 |
10 | 21933504000 |
11 | 9335989211 |
12 | 43015a0000 |
13 | 20b713c345 |
14 | 10c0dd1692 |
15 | 885896000 |
hex | 51b56b600 |
21933504000 has 400 divisors, whose sum is σ = 81720546336. Its totient is φ = 5847552000.
The previous prime is 21933503957. The next prime is 21933504001. The reversal of 21933504000 is 40533912.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21933504001) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5181885 + ... + 5186115.
Almost surely, 221933504000 is an apocalyptic number.
21933504000 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 21933504000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40860273168).
21933504000 is an abundant number, since it is smaller than the sum of its proper divisors (59787042336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21933504000 is an frugal number, since it uses more digits than its factorization.
21933504000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4276 (or 4241 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The spelling of 21933504000 in words is "twenty-one billion, nine hundred thirty-three million, five hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •