Base | Representation |
---|---|
bin | 110101100111… |
… | …0110110100000 |
3 | 1221220011000000 |
4 | 1223032312200 |
5 | 24144011430 |
6 | 2442300000 |
7 | 460635024 |
oct | 153166640 |
9 | 57804000 |
10 | 28110240 |
11 | 1495a704 |
12 | 94b7600 |
13 | 5a92aa2 |
14 | 3a3a384 |
15 | 2703e60 |
hex | 1aceda0 |
28110240 has 168 divisors, whose sum is σ = 99983268. Its totient is φ = 7464960.
The previous prime is 28110239. The next prime is 28110259. The reversal of 28110240 is 4201182.
It can be written as a sum of positive squares in 2 ways, for example, as 28005264 + 104976 = 5292^2 + 324^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
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 27 ways as a sum of consecutive naturals, for example, 116520 + ... + 116760.
Almost surely, 228110240 is an apocalyptic number.
28110240 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 28110240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49991634).
28110240 is an abundant number, since it is smaller than the sum of its proper divisors (71873028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28110240 is an equidigital number, since it uses as much as digits as its factorization.
28110240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274 (or 251 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 28110240 is about 5301.9090901297. The cubic root of 28110240 is about 304.0568914762.
The spelling of 28110240 in words is "twenty-eight million, one hundred ten thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •