Base | Representation |
---|---|
bin | 110110111110… |
… | …1111001110100 |
3 | 2000020120120000 |
4 | 1231331321310 |
5 | 24334433002 |
6 | 2505511300 |
7 | 500012316 |
oct | 155757164 |
9 | 60216500 |
10 | 28827252 |
11 | 152aa383 |
12 | 97a2530 |
13 | 5c8425c |
14 | 3b857b6 |
15 | 27e661c |
hex | 1b7de74 |
28827252 has 60 divisors (see below), whose sum is σ = 75914916. Its totient is φ = 9538560.
The previous prime is 28827251. The next prime is 28827263. The reversal of 28827252 is 25272882.
It can be written as a sum of positive squares in 2 ways, for example, as 8088336 + 20738916 = 2844^2 + 4554^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28827251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 62302 + ... + 62762.
Almost surely, 228827252 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 28827252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37957458).
28827252 is an abundant number, since it is smaller than the sum of its proper divisors (47087664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28827252 is a wasteful number, since it uses less digits than its factorization.
28827252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670 (or 659 counting only the distinct ones).
The product of its digits is 35840, while the sum is 36.
The square root of 28827252 is about 5369.1016008267. The cubic root of 28827252 is about 306.6204251848.
The spelling of 28827252 in words is "twenty-eight million, eight hundred twenty-seven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •