Base | Representation |
---|---|
bin | 110110011001… |
… | …0000110010000 |
3 | 1222122210122000 |
4 | 1230302012100 |
5 | 24300014002 |
6 | 2455114000 |
7 | 464250135 |
oct | 154620620 |
9 | 58583560 |
10 | 28516752 |
11 | 15108070 |
12 | 9672900 |
13 | 5ba5b24 |
14 | 3b0458c |
15 | 278461c |
hex | 1b32190 |
28516752 has 160 divisors (see below), whose sum is σ = 94815360. Its totient is φ = 8110080.
The previous prime is 28516727. The next prime is 28516759. The reversal of 28516752 is 25761582.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (28516759) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 80608 + ... + 80960.
It is an arithmetic number, because the mean of its divisors is an integer number (592596).
Almost surely, 228516752 is an apocalyptic number.
28516752 is a gapful number since it is divisible by the number (22) 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 28516752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47407680).
28516752 is an abundant number, since it is smaller than the sum of its proper divisors (66298608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28516752 is a wasteful number, since it uses less digits than its factorization.
28516752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398 (or 386 counting only the distinct ones).
The product of its digits is 33600, while the sum is 36.
The square root of 28516752 is about 5340.1078640792. The cubic root of 28516752 is about 305.5155733813.
The spelling of 28516752 in words is "twenty-eight million, five hundred sixteen thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •