Base | Representation |
---|---|
bin | 110110110101… |
… | …0101000010000 |
3 | 2000002120021000 |
4 | 1231222220100 |
5 | 24324421204 |
6 | 2504102000 |
7 | 466233204 |
oct | 155525020 |
9 | 60076230 |
10 | 28748304 |
11 | 15256032 |
12 | 9764900 |
13 | 5c57340 |
14 | 3b64b04 |
15 | 27cd039 |
hex | 1b6aa10 |
28748304 has 80 divisors (see below), whose sum is σ = 88883200. Its totient is φ = 8843904.
The previous prime is 28748261. The next prime is 28748327. The reversal of 28748304 is 40384782.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3057 + ... + 8175.
It is an arithmetic number, because the mean of its divisors is an integer number (1111040).
Almost surely, 228748304 is an apocalyptic number.
28748304 is a gapful number since it is divisible by the number (24) 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 28748304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44441600).
28748304 is an abundant number, since it is smaller than the sum of its proper divisors (60134896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28748304 is a wasteful number, since it uses less digits than its factorization.
28748304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5149 (or 5137 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 36.
The square root of 28748304 is about 5361.7444922338. The cubic root of 28748304 is about 306.3402597207.
The spelling of 28748304 in words is "twenty-eight million, seven hundred forty-eight thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •