Base | Representation |
---|---|
bin | 110110111111… |
… | …1001111101100 |
3 | 2000020212002120 |
4 | 1231333033230 |
5 | 24340121443 |
6 | 2505552540 |
7 | 500034330 |
oct | 155771754 |
9 | 60225076 |
10 | 28832748 |
11 | 1530351a |
12 | 97a5750 |
13 | 5c868c9 |
14 | 3b877c0 |
15 | 27e8083 |
hex | 1b7f3ec |
28832748 has 96 divisors (see below), whose sum is σ = 82994688. Its totient is φ = 7603200.
The previous prime is 28832743. The next prime is 28832779. The reversal of 28832748 is 84723882.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28832743) 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, 86943 + ... + 87273.
It is an arithmetic number, because the mean of its divisors is an integer number (864528).
Almost surely, 228832748 is an apocalyptic number.
28832748 is a gapful number since it is divisible by the number (28) 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 28832748, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41497344).
28832748 is an abundant number, since it is smaller than the sum of its proper divisors (54161940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28832748 is a wasteful number, since it uses less digits than its factorization.
28832748 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423 (or 421 counting only the distinct ones).
The product of its digits is 172032, while the sum is 42.
The square root of 28832748 is about 5369.6133939046. The cubic root of 28832748 is about 306.6399099739.
The spelling of 28832748 in words is "twenty-eight million, eight hundred thirty-two thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •