Base | Representation |
---|---|
bin | 110101111001… |
… | …0011001000000 |
3 | 1222011112200102 |
4 | 1223302121000 |
5 | 24213141213 |
6 | 2445341532 |
7 | 462112310 |
oct | 153623100 |
9 | 58145612 |
10 | 28255808 |
11 | 14a4a009 |
12 | 95678a8 |
13 | 5b14119 |
14 | 3a77440 |
15 | 2732158 |
hex | 1af2640 |
28255808 has 56 divisors (see below), whose sum is σ = 65227200. Its totient is φ = 11893248.
The previous prime is 28255807. The next prime is 28255841. The reversal of 28255808 is 80855282.
It is a tau number, because it is divible by the number of its divisors (56).
It is not an unprimeable number, because it can be changed into a prime (28255807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25898 + ... + 26966.
Almost surely, 228255808 is an apocalyptic number.
28255808 is a gapful number since it is divisible by the number (28) 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 28255808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32613600).
28255808 is an abundant number, since it is smaller than the sum of its proper divisors (36971392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28255808 is a wasteful number, since it uses less digits than its factorization.
28255808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147 (or 1137 counting only the distinct ones).
The product of its (nonzero) digits is 51200, while the sum is 38.
The square root of 28255808 is about 5315.6192489681. The cubic root of 28255808 is about 304.5808378068.
The spelling of 28255808 in words is "twenty-eight million, two hundred fifty-five thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •