Base | Representation |
---|---|
bin | 110110101011… |
… | …1011110110000 |
3 | 1222221120200010 |
4 | 1231113132300 |
5 | 24314413442 |
6 | 2502254520 |
7 | 465455430 |
oct | 155273660 |
9 | 58846603 |
10 | 28669872 |
11 | 15202110 |
12 | 9727440 |
13 | 5c2a72a |
14 | 3b442c0 |
15 | 27b4b9c |
hex | 1b577b0 |
28669872 has 80 divisors (see below), whose sum is σ = 92351232. Its totient is φ = 7445760.
The previous prime is 28669867. The next prime is 28669877. The reversal of 28669872 is 27896682.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (28669867) and next prime (28669877).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (28669877) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 183 + ... + 7574.
Almost surely, 228669872 is an apocalyptic number.
28669872 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 28669872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46175616).
28669872 is an abundant number, since it is smaller than the sum of its proper divisors (63681360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28669872 is a wasteful number, since it uses less digits than its factorization.
28669872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7786 (or 7780 counting only the distinct ones).
The product of its digits is 580608, while the sum is 48.
The square root of 28669872 is about 5354.4254593747. The cubic root of 28669872 is about 306.0614170370.
The spelling of 28669872 in words is "twenty-eight million, six hundred sixty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •