Base | Representation |
---|---|
bin | 101000000000… |
… | …0111011100000 |
3 | 1110110122202000 |
4 | 1100000323200 |
5 | 20332202303 |
6 | 2025324000 |
7 | 343200363 |
oct | 120007340 |
9 | 43418660 |
10 | 20975328 |
11 | 10927090 |
12 | 7036600 |
13 | 446534a |
14 | 2b000da |
15 | 1c94da3 |
hex | 1400ee0 |
20975328 has 96 divisors (see below), whose sum is σ = 66769920. Its totient is φ = 6353280.
The previous prime is 20975291. The next prime is 20975341. The reversal of 20975328 is 82357902.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 20975292 and 20975301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8401 + ... + 10607.
It is an arithmetic number, because the mean of its divisors is an integer number (695520).
Almost surely, 220975328 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 20975328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33384960).
20975328 is an abundant number, since it is smaller than the sum of its proper divisors (45794592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20975328 is a wasteful number, since it uses less digits than its factorization.
20975328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2237 (or 2223 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 20975328 is about 4579.8829679371. The cubic root of 20975328 is about 275.7843305723.
The spelling of 20975328 in words is "twenty million, nine hundred seventy-five thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •