Base | Representation |
---|---|
bin | 110111000100… |
… | …0100110010100 |
3 | 2000022210122112 |
4 | 1232020212110 |
5 | 24342333220 |
6 | 2510450152 |
7 | 500254121 |
oct | 156104624 |
9 | 60283575 |
10 | 28871060 |
11 | 1532a289 |
12 | 9803958 |
13 | 5c9b18a |
14 | 3b97748 |
15 | 28045c5 |
hex | 1b88994 |
28871060 has 48 divisors (see below), whose sum is σ = 63201600. Its totient is φ = 11069184.
The previous prime is 28871057. The next prime is 28871069. The reversal of 28871060 is 6017882.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28871069) by changing a digit.
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, 50456 + ... + 51024.
It is an arithmetic number, because the mean of its divisors is an integer number (1316700).
Almost surely, 228871060 is an apocalyptic number.
28871060 is a gapful number since it is divisible by the number (20) 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 28871060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31600800).
28871060 is an abundant number, since it is smaller than the sum of its proper divisors (34330540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28871060 is a wasteful number, since it uses less digits than its factorization.
28871060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680 (or 678 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 32.
The square root of 28871060 is about 5373.1796917654. The cubic root of 28871060 is about 306.7756675116.
The spelling of 28871060 in words is "twenty-eight million, eight hundred seventy-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •