Base | Representation |
---|---|
bin | 10011111001011110… |
… | …101010110011010000 |
3 | 2001010222211120202122 |
4 | 103321132222303100 |
5 | 322224022414400 |
6 | 13452023233412 |
7 | 1354312130465 |
oct | 237136526320 |
9 | 61128746678 |
10 | 21365435600 |
11 | 907425aaa3 |
12 | 41832a8868 |
13 | 20265439b2 |
14 | 106979b66c |
15 | 850a84685 |
hex | 4f97aacd0 |
21365435600 has 120 divisors (see below), whose sum is σ = 53714395392. Its totient is φ = 8156851200.
The previous prime is 21365435591. The next prime is 21365435629. The reversal of 21365435600 is 653456312.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
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 23 ways as a sum of consecutive naturals, for example, 893399 + ... + 917001.
Almost surely, 221365435600 is an apocalyptic number.
21365435600 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 21365435600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26857197696).
21365435600 is an abundant number, since it is smaller than the sum of its proper divisors (32348959792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21365435600 is a wasteful number, since it uses less digits than its factorization.
21365435600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23725 (or 23714 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
The spelling of 21365435600 in words is "twenty-one billion, three hundred sixty-five million, four hundred thirty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •