Base | Representation |
---|---|
bin | 110110111110… |
… | …1011010010100 |
3 | 2000020110210100 |
4 | 1231331122110 |
5 | 24334401421 |
6 | 2505454100 |
7 | 500003406 |
oct | 155753224 |
9 | 60213710 |
10 | 28825236 |
11 | 152a8910 |
12 | 97a1330 |
13 | 5c8336b |
14 | 3b84b76 |
15 | 27e5c26 |
hex | 1b7d694 |
28825236 has 72 divisors (see below), whose sum is σ = 80537184. Its totient is φ = 8619840.
The previous prime is 28825229. The next prime is 28825249. The reversal of 28825236 is 63252882.
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 28825236.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32430 + ... + 33306.
It is an arithmetic number, because the mean of its divisors is an integer number (1118572).
Almost surely, 228825236 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 28825236, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40268592).
28825236 is an abundant number, since it is smaller than the sum of its proper divisors (51711948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28825236 is a wasteful number, since it uses less digits than its factorization.
28825236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981 (or 976 counting only the distinct ones).
The product of its digits is 46080, while the sum is 36.
The square root of 28825236 is about 5368.9138566380. The cubic root of 28825236 is about 306.6132773051.
It can be divided in two parts, 2882 and 5236, that added together give a palindrome (8118).
The spelling of 28825236 in words is "twenty-eight million, eight hundred twenty-five thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •