Base | Representation |
---|---|
bin | 110110110101… |
… | …1010100011000 |
3 | 2000002201010121 |
4 | 1231223110120 |
5 | 24330014003 |
6 | 2504123024 |
7 | 466244350 |
oct | 155532430 |
9 | 60081117 |
10 | 28751128 |
11 | 1525816a |
12 | 9766474 |
13 | 5c58703 |
14 | 3b65b60 |
15 | 27cdcbd |
hex | 1b6b518 |
28751128 has 32 divisors (see below), whose sum is σ = 61781760. Its totient is φ = 12287520.
The previous prime is 28751119. The next prime is 28751141. The reversal of 28751128 is 82115782.
It is a super-2 number, since 2×287511282 = 1653254722544768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28751093 and 28751102.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 38325 + ... + 39067.
It is an arithmetic number, because the mean of its divisors is an integer number (1930680).
Almost surely, 228751128 is an apocalyptic number.
28751128 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
28751128 is an abundant number, since it is smaller than the sum of its proper divisors (33030632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28751128 is a wasteful number, since it uses less digits than its factorization.
28751128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447 (or 1443 counting only the distinct ones).
The product of its digits is 8960, while the sum is 34.
The square root of 28751128 is about 5362.0078328925. The cubic root of 28751128 is about 306.3502901856.
It can be divided in two parts, 287 and 51128, that added together give a palindrome (51415).
The spelling of 28751128 in words is "twenty-eight million, seven hundred fifty-one thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •