Base | Representation |
---|---|
bin | 110101111011… |
… | …0110100101000 |
3 | 1222012110120201 |
4 | 1223312310220 |
5 | 24214231320 |
6 | 2450001544 |
7 | 462216241 |
oct | 153666450 |
9 | 58173521 |
10 | 28273960 |
11 | 14a61710 |
12 | 95762b4 |
13 | 5b1c470 |
14 | 3a7dcc8 |
15 | 273770a |
hex | 1af6d28 |
28273960 has 64 divisors (see below), whose sum is σ = 74753280. Its totient is φ = 9488640.
The previous prime is 28273951. The next prime is 28273967. The reversal of 28273960 is 6937282.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (28273967) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3249 + ... + 8191.
It is an arithmetic number, because the mean of its divisors is an integer number (1168020).
Almost surely, 228273960 is an apocalyptic number.
28273960 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 28273960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37376640).
28273960 is an abundant number, since it is smaller than the sum of its proper divisors (46479320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28273960 is a wasteful number, since it uses less digits than its factorization.
28273960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4978 (or 4974 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 37.
The square root of 28273960 is about 5317.3263958497. The cubic root of 28273960 is about 304.6460464402.
The spelling of 28273960 in words is "twenty-eight million, two hundred seventy-three thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •