Base | Representation |
---|---|
bin | 101000001001… |
… | …0111000000000 |
3 | 1110121101120101 |
4 | 1100102320000 |
5 | 20342030312 |
6 | 2031052144 |
7 | 343624600 |
oct | 120227000 |
9 | 43541511 |
10 | 21048832 |
11 | 10977332 |
12 | 7071054 |
13 | 448c93c |
14 | 2b1cc00 |
15 | 1caba57 |
hex | 1412e00 |
21048832 has 60 divisors (see below), whose sum is σ = 48981240. Its totient is φ = 9010176.
The previous prime is 21048829. The next prime is 21048857. The reversal of 21048832 is 23884012.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 21048832.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 24669 + ... + 25507.
It is an arithmetic number, because the mean of its divisors is an integer number (816354).
Almost surely, 221048832 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 21048832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24490620).
21048832 is an abundant number, since it is smaller than the sum of its proper divisors (27932408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21048832 is an frugal number, since it uses more digits than its factorization.
21048832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 871 (or 848 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
The square root of 21048832 is about 4587.9006092111. The cubic root of 21048832 is about 276.1060993749.
The spelling of 21048832 in words is "twenty-one million, forty-eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •