Base | Representation |
---|---|
bin | 110111001000… |
… | …0000011100000 |
3 | 2000101100112122 |
4 | 1232100003200 |
5 | 24344322400 |
6 | 2511243412 |
7 | 500442140 |
oct | 156200340 |
9 | 60340478 |
10 | 28901600 |
11 | 15350222 |
12 | 9819568 |
13 | 5cac050 |
14 | 3ba4920 |
15 | 280d685 |
hex | 1b900e0 |
28901600 has 144 divisors (see below), whose sum is σ = 87056928. Its totient is φ = 9123840.
The previous prime is 28901599. The next prime is 28901627. The reversal of 28901600 is 610982.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 28901600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 72602 + ... + 72998.
It is an arithmetic number, because the mean of its divisors is an integer number (604562).
Almost surely, 228901600 is an apocalyptic number.
28901600 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 28901600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43528464).
28901600 is an abundant number, since it is smaller than the sum of its proper divisors (58155328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28901600 is a wasteful number, since it uses less digits than its factorization.
28901600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437 (or 424 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 28901600 is about 5376.0208332930. The cubic root of 28901600 is about 306.8837991761.
The spelling of 28901600 in words is "twenty-eight million, nine hundred one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •