Base | Representation |
---|---|
bin | 110101100001… |
… | …1110101101000 |
3 | 1221210212010012 |
4 | 1223003311220 |
5 | 24141041003 |
6 | 2441311052 |
7 | 460356350 |
oct | 153036550 |
9 | 57725105 |
10 | 28065128 |
11 | 14929823 |
12 | 9495488 |
13 | 5a783b0 |
14 | 3a27b60 |
15 | 26e58d8 |
hex | 1ac3d68 |
28065128 has 64 divisors (see below), whose sum is σ = 68208000. Its totient is φ = 10513152.
The previous prime is 28065119. The next prime is 28065133. The reversal of 28065128 is 82156082.
It is a junction number, because it is equal to n+sod(n) for n = 28065094 and 28065103.
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 15 ways as a sum of consecutive naturals, for example, 12818 + ... + 14846.
It is an arithmetic number, because the mean of its divisors is an integer number (1065750).
Almost surely, 228065128 is an apocalyptic number.
28065128 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28065128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34104000).
28065128 is an abundant number, since it is smaller than the sum of its proper divisors (40142872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28065128 is a wasteful number, since it uses less digits than its factorization.
28065128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2074 (or 2070 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 32.
The square root of 28065128 is about 5297.6530652733. The cubic root of 28065128 is about 303.8941517460.
The spelling of 28065128 in words is "twenty-eight million, sixty-five thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •