Base | Representation |
---|---|
bin | 110110010001… |
… | …1011011000000 |
3 | 1222112202011122 |
4 | 1230203123000 |
5 | 24241103030 |
6 | 2453531412 |
7 | 463606652 |
oct | 154433300 |
9 | 58482148 |
10 | 28456640 |
11 | 15076993 |
12 | 9643b68 |
13 | 5b84664 |
14 | 3aca6d2 |
15 | 27718e5 |
hex | 1b236c0 |
28456640 has 56 divisors (see below), whose sum is σ = 71762112. Its totient is φ = 10711040.
The previous prime is 28456619. The next prime is 28456643. The reversal of 28456640 is 4665482.
It is a self number, because there is not a number n which added to its sum of digits gives 28456640.
It is not an unprimeable number, because it can be changed into a prime (28456643) 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 7 ways as a sum of consecutive naturals, for example, 2825 + ... + 8055.
Almost surely, 228456640 is an apocalyptic number.
28456640 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 28456640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35881056).
28456640 is an abundant number, since it is smaller than the sum of its proper divisors (43305472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28456640 is a wasteful number, since it uses less digits than its factorization.
28456640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5265 (or 5255 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 35.
The square root of 28456640 is about 5334.4765441419. The cubic root of 28456640 is about 305.3007514458.
The spelling of 28456640 in words is "twenty-eight million, four hundred fifty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •