Base | Representation |
---|---|
bin | 110110001110… |
… | …0001111111000 |
3 | 1222111020212100 |
4 | 1230130033320 |
5 | 24234133011 |
6 | 2453143400 |
7 | 463425204 |
oct | 154341770 |
9 | 58436770 |
10 | 28427256 |
11 | 15056900 |
12 | 962ab60 |
13 | 5b74180 |
14 | 3abdb04 |
15 | 2767d56 |
hex | 1b1c3f8 |
28427256 has 144 divisors (see below), whose sum is σ = 91498680. Its totient is φ = 7920000.
The previous prime is 28427237. The next prime is 28427261. The reversal of 28427256 is 65272482.
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (53760) is a multiple of the sum of its prime divisors (280).
It is a self number, because there is not a number n which added to its sum of digits gives 28427256.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 113131 + ... + 113381.
Almost surely, 228427256 is an apocalyptic number.
28427256 is a gapful number since it is divisible by the number (26) 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 28427256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45749340).
28427256 is an abundant number, since it is smaller than the sum of its proper divisors (63071424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28427256 is a wasteful number, since it uses less digits than its factorization.
28427256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 298 (or 280 counting only the distinct ones).
The product of its digits is 53760, while the sum is 36.
The square root of 28427256 is about 5331.7216731559. The cubic root of 28427256 is about 305.1956319046.
The spelling of 28427256 in words is "twenty-eight million, four hundred twenty-seven thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •