Base | Representation |
---|---|
bin | 110110010100… |
… | …0111010111101 |
3 | 1222120220001220 |
4 | 1230220322331 |
5 | 24242313130 |
6 | 2454223553 |
7 | 464032431 |
oct | 154507275 |
9 | 58526056 |
10 | 28479165 |
11 | 15091900 |
12 | 9654bb9 |
13 | 5b919a0 |
14 | 3ad49c1 |
15 | 2778410 |
hex | 1b28ebd |
28479165 has 96 divisors (see below), whose sum is σ = 57915648. Its totient is φ = 11827200.
The previous prime is 28479163. The next prime is 28479167. The reversal of 28479165 is 56197482.
It is an interprime number because it is at equal distance from previous prime (28479163) and next prime (28479167).
It is not a de Polignac number, because 28479165 - 21 = 28479163 is a prime.
It is a super-2 number, since 2×284791652 = 1622125678194450, which contains 22 as substring.
Its product of digits (120960) is a multiple of the sum of its prime divisors (120).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28479161) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 401080 + ... + 401150.
It is an arithmetic number, because the mean of its divisors is an integer number (603288).
Almost surely, 228479165 is an apocalyptic number.
It is an amenable number.
28479165 is an abundant number, since it is smaller than the sum of its proper divisors (29436483).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28479165 is a wasteful number, since it uses less digits than its factorization.
28479165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131 (or 120 counting only the distinct ones).
The product of its digits is 120960, while the sum is 42.
The square root of 28479165 is about 5336.5873927071. The cubic root of 28479165 is about 305.3812843284.
The spelling of 28479165 in words is "twenty-eight million, four hundred seventy-nine thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •