Base | Representation |
---|---|
bin | 110101111001… |
… | …0111010010000 |
3 | 1222011122121020 |
4 | 1223302322100 |
5 | 24213223221 |
6 | 2445355440 |
7 | 462121440 |
oct | 153627220 |
9 | 58148536 |
10 | 28257936 |
11 | 14a50673 |
12 | 9568b80 |
13 | 5b15095 |
14 | 3a78120 |
15 | 2732ac6 |
hex | 1af2e90 |
28257936 has 80 divisors (see below), whose sum is σ = 85720704. Its totient is φ = 7852032.
The previous prime is 28257907. The next prime is 28257937. The reversal of 28257936 is 63975282.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (28257937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11296 + ... + 13568.
Almost surely, 228257936 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 28257936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42860352).
28257936 is an abundant number, since it is smaller than the sum of its proper divisors (57462768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28257936 is a wasteful number, since it uses less digits than its factorization.
28257936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2328 (or 2322 counting only the distinct ones).
The product of its digits is 181440, while the sum is 42.
The square root of 28257936 is about 5315.8194100251. The cubic root of 28257936 is about 304.5884838072.
The spelling of 28257936 in words is "twenty-eight million, two hundred fifty-seven thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •