Base | Representation |
---|---|
bin | 110110010010… |
… | …0011001101100 |
3 | 1222112221200020 |
4 | 1230210121230 |
5 | 24241220102 |
6 | 2454002140 |
7 | 463624443 |
oct | 154443154 |
9 | 58487606 |
10 | 28460652 |
11 | 15079a00 |
12 | 9646350 |
13 | 5b8642c |
14 | 3acbd5a |
15 | 2772bbc |
hex | 1b2466c |
28460652 has 72 divisors (see below), whose sum is σ = 77354928. Its totient is φ = 8110080.
The previous prime is 28460633. The next prime is 28460671. The reversal of 28460652 is 25606482.
It is an interprime number because it is at equal distance from previous prime (28460633) and next prime (28460671).
It is a Harshad number since it is a multiple of its sum of digits (33).
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, 24108 + ... + 25260.
It is an arithmetic number, because the mean of its divisors is an integer number (1074374).
Almost surely, 228460652 is an apocalyptic number.
28460652 is a gapful number since it is divisible by the number (22) 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 28460652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38677464).
28460652 is an abundant number, since it is smaller than the sum of its proper divisors (48894276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28460652 is a wasteful number, since it uses less digits than its factorization.
28460652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1199 (or 1186 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The square root of 28460652 is about 5334.8525752827. The cubic root of 28460652 is about 305.3150985256.
The spelling of 28460652 in words is "twenty-eight million, four hundred sixty thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •