Base | Representation |
---|---|
bin | 110101101000… |
… | …1010111000000 |
3 | 1221220200002110 |
4 | 1223101113000 |
5 | 24144324022 |
6 | 2442415320 |
7 | 461010000 |
oct | 153212700 |
9 | 57820073 |
10 | 28120512 |
11 | 149673a2 |
12 | 9501540 |
13 | 5a97674 |
14 | 3a40000 |
15 | 270700c |
hex | 1ad15c0 |
28120512 has 140 divisors (see below), whose sum is σ = 88220296. Its totient is φ = 7902720.
The previous prime is 28120511. The next prime is 28120577. The reversal of 28120512 is 21502182.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28120511) 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 19 ways as a sum of consecutive naturals, for example, 460962 + ... + 461022.
Almost surely, 228120512 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 28120512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44110148).
28120512 is an abundant number, since it is smaller than the sum of its proper divisors (60099784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28120512 is an frugal number, since it uses more digits than its factorization.
28120512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104 (or 73 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
The square root of 28120512 is about 5302.8777093197. The cubic root of 28120512 is about 304.0939229641.
Adding to 28120512 its reverse (21502182), we get a palindrome (49622694).
The spelling of 28120512 in words is "twenty-eight million, one hundred twenty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •