Base | Representation |
---|---|
bin | 101000001010… |
… | …0101101100000 |
3 | 1110121202212220 |
4 | 1100110231200 |
5 | 20342300402 |
6 | 2031151040 |
7 | 343655532 |
oct | 120245540 |
9 | 43552786 |
10 | 21056352 |
11 | 10981a49 |
12 | 7075480 |
13 | 44931a5 |
14 | 2b21852 |
15 | 1caddbc |
hex | 1414b60 |
21056352 has 48 divisors (see below), whose sum is σ = 55711152. Its totient is φ = 6963200.
The previous prime is 21056311. The next prime is 21056363. The reversal of 21056352 is 25365012.
It is a tau number, because it is divible by the number of its divisors (48).
It is a hoax number, since the sum of its digits (24) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12352 + ... + 13952.
It is an arithmetic number, because the mean of its divisors is an integer number (1160649).
Almost surely, 221056352 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 21056352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27855576).
21056352 is an abundant number, since it is smaller than the sum of its proper divisors (34654800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21056352 is a wasteful number, since it uses less digits than its factorization.
21056352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751 (or 1743 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 21056352 is about 4588.7200829861. The cubic root of 21056352 is about 276.1389764272.
The spelling of 21056352 in words is "twenty-one million, fifty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •