Base | Representation |
---|---|
bin | 110101011010… |
… | …1010101000000 |
3 | 1221200211121000 |
4 | 1222311111000 |
5 | 24132140241 |
6 | 2440132000 |
7 | 460021155 |
oct | 152652500 |
9 | 57624530 |
10 | 28005696 |
11 | 14899104 |
12 | 9467000 |
13 | 5a57324 |
14 | 3a1022c |
15 | 26d2eb6 |
hex | 1ab5540 |
28005696 has 112 divisors (see below), whose sum is σ = 86766400. Its totient is φ = 8833536.
The previous prime is 28005683. The next prime is 28005701. The reversal of 28005696 is 69650082.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 28005696.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 32406 + ... + 33258.
It is an arithmetic number, because the mean of its divisors is an integer number (774700).
Almost surely, 228005696 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28005696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43383200).
28005696 is an abundant number, since it is smaller than the sum of its proper divisors (58760704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28005696 is a wasteful number, since it uses less digits than its factorization.
28005696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893 (or 877 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 28005696 is about 5292.0408161691. The cubic root of 28005696 is about 303.6794867567.
The spelling of 28005696 in words is "twenty-eight million, five thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •