Base | Representation |
---|---|
bin | 110110101000… |
… | …1100001111100 |
3 | 1222220100020110 |
4 | 1231101201330 |
5 | 24313124000 |
6 | 2501550020 |
7 | 465324402 |
oct | 155214174 |
9 | 58810213 |
10 | 28645500 |
11 | 15195874 |
12 | 9715310 |
13 | 5c1c600 |
14 | 3b39472 |
15 | 27ac850 |
hex | 1b5187c |
28645500 has 144 divisors (see below), whose sum is σ = 91125216. Its totient is φ = 6988800.
The previous prime is 28645499. The next prime is 28645517. The reversal of 28645500 is 554682.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 253444 + ... + 253556.
It is an arithmetic number, because the mean of its divisors is an integer number (632814).
Almost surely, 228645500 is an apocalyptic number.
28645500 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 28645500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45562608).
28645500 is an abundant number, since it is smaller than the sum of its proper divisors (62479716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28645500 is a wasteful number, since it uses less digits than its factorization.
28645500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 136 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The square root of 28645500 is about 5352.1491010621. The cubic root of 28645500 is about 305.9746657654.
The spelling of 28645500 in words is "twenty-eight million, six hundred forty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •