Base | Representation |
---|---|
bin | 101000010110… |
… | …1011011100000 |
3 | 1110210220202211 |
4 | 1100231123200 |
5 | 20404020400 |
6 | 2033251504 |
7 | 344556652 |
oct | 120553340 |
9 | 43726684 |
10 | 21157600 |
11 | 10a41022 |
12 | 7103b94 |
13 | 44ca2b9 |
14 | 2b4a6d2 |
15 | 1ccddba |
hex | 142d6e0 |
21157600 has 72 divisors (see below), whose sum is σ = 52731000. Its totient is φ = 8286720.
The previous prime is 21157597. The next prime is 21157601. The reversal of 21157600 is 675112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21157601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42151 + ... + 42649.
It is an arithmetic number, because the mean of its divisors is an integer number (732375).
Almost surely, 221157600 is an apocalyptic number.
21157600 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 21157600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26365500).
21157600 is an abundant number, since it is smaller than the sum of its proper divisors (31573400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21157600 is a wasteful number, since it uses less digits than its factorization.
21157600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 572 (or 559 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 22.
The square root of 21157600 is about 4599.7391230373. The cubic root of 21157600 is about 276.5808672513.
The spelling of 21157600 in words is "twenty-one million, one hundred fifty-seven thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •