Base | Representation |
---|---|
bin | 10011101111101000… |
… | …101110100101110000 |
3 | 2000201111002211212010 |
4 | 103233220232211300 |
5 | 321404234103100 |
6 | 13423404002520 |
7 | 1350235402656 |
oct | 235750564560 |
9 | 60644084763 |
10 | 21200300400 |
11 | 8a9a020524 |
12 | 4137b30440 |
13 | 1ccb275a66 |
14 | 1051892dd6 |
15 | 841315750 |
hex | 4efa2e970 |
21200300400 has 60 divisors (see below), whose sum is σ = 67911632792. Its totient is φ = 5653413120.
The previous prime is 21200300383. The next prime is 21200300417. The reversal of 21200300400 is 400300212.
It is an interprime number because it is at equal distance from previous prime (21200300383) and next prime (21200300417).
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8832259 + ... + 8834658.
Almost surely, 221200300400 is an apocalyptic number.
21200300400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21200300400 is an abundant number, since it is smaller than the sum of its proper divisors (46711332392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21200300400 is a wasteful number, since it uses less digits than its factorization.
21200300400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17666938 (or 17666927 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 21200300400 its reverse (400300212), we get a palindrome (21600600612).
The spelling of 21200300400 in words is "twenty-one billion, two hundred million, three hundred thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •