Base | Representation |
---|---|
bin | 101000010000… |
… | …1011111000000 |
3 | 1110201102122200 |
4 | 1100201133000 |
5 | 20400434142 |
6 | 2032233200 |
7 | 344264214 |
oct | 120413700 |
9 | 43642580 |
10 | 21108672 |
11 | 10a08292 |
12 | 709b800 |
13 | 44b0c50 |
14 | 2b36944 |
15 | 1cbe64c |
hex | 14217c0 |
21108672 has 84 divisors (see below), whose sum is σ = 65181480. Its totient is φ = 6492672.
The previous prime is 21108671. The next prime is 21108673. The reversal of 21108672 is 27680112.
It is an interprime number because it is at equal distance from previous prime (21108671) and next prime (21108673).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21108671) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6079 + ... + 8897.
It is an arithmetic number, because the mean of its divisors is an integer number (775970).
Almost surely, 221108672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21108672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32590740).
21108672 is an abundant number, since it is smaller than the sum of its proper divisors (44072808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21108672 is a wasteful number, since it uses less digits than its factorization.
21108672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850 (or 2837 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 21108672 is about 4594.4174821189. The cubic root of 21108672 is about 276.3675003657.
Adding to 21108672 its reverse (27680112), we get a palindrome (48788784).
The spelling of 21108672 in words is "twenty-one million, one hundred eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •