Base | Representation |
---|---|
bin | 110101111000… |
… | …1010011000000 |
3 | 1222011022112111 |
4 | 1223301103000 |
5 | 24213020303 |
6 | 2445305104 |
7 | 462063250 |
oct | 153612300 |
9 | 58138474 |
10 | 28251328 |
11 | 14a46706 |
12 | 9565194 |
13 | 5b12081 |
14 | 3a75960 |
15 | 2730b6d |
hex | 1af14c0 |
28251328 has 56 divisors (see below), whose sum is σ = 67462400. Its totient is φ = 11467008.
The previous prime is 28251281. The next prime is 28251341. The reversal of 28251328 is 82315282.
It is a tau number, because it is divible by the number of its divisors (56).
It is a self number, because there is not a number n which added to its sum of digits gives 28251328.
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 7 ways as a sum of consecutive naturals, for example, 6853 + ... + 10171.
Almost surely, 228251328 is an apocalyptic number.
28251328 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 28251328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33731200).
28251328 is an abundant number, since it is smaller than the sum of its proper divisors (39211072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28251328 is a wasteful number, since it uses less digits than its factorization.
28251328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3357 (or 3347 counting only the distinct ones).
The product of its digits is 7680, while the sum is 31.
The square root of 28251328 is about 5315.1978326305. The cubic root of 28251328 is about 304.5647397091.
The spelling of 28251328 in words is "twenty-eight million, two hundred fifty-one thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •