Base | Representation |
---|---|
bin | 110110010010… |
… | …0001111100000 |
3 | 1222112220210002 |
4 | 1230210033200 |
5 | 24241210000 |
6 | 2453555132 |
7 | 463622522 |
oct | 154441740 |
9 | 58486702 |
10 | 28460000 |
11 | 15079468 |
12 | 9645aa8 |
13 | 5b8604a |
14 | 3acba12 |
15 | 27728d5 |
hex | 1b243e0 |
28460000 has 60 divisors (see below), whose sum is σ = 70065072. Its totient is φ = 11376000.
The previous prime is 28459979. The next prime is 28460011. The reversal of 28460000 is 6482.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 9 ways as a sum of consecutive naturals, for example, 19289 + ... + 20711.
Almost surely, 228460000 is an apocalyptic number.
28460000 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 28460000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35032536).
28460000 is an abundant number, since it is smaller than the sum of its proper divisors (41605072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28460000 is an equidigital number, since it uses as much as digits as its factorization.
28460000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1453 (or 1430 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 28460000 is about 5334.7914673397. The cubic root of 28460000 is about 305.3127670381.
Adding to 28460000 its reverse (6482), we get a palindrome (28466482).
The spelling of 28460000 in words is "twenty-eight million, four hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •