Base | Representation |
---|---|
bin | 1111010001001… |
… | …00011001000000 |
3 | 22220222220022200 |
4 | 13220210121000 |
5 | 230241402303 |
6 | 20413033200 |
7 | 3113423313 |
oct | 750443100 |
9 | 286886280 |
10 | 128075328 |
11 | 66327987 |
12 | 36a85800 |
13 | 206c3724 |
14 | 1301c97a |
15 | b39d3a3 |
hex | 7a24640 |
128075328 has 84 divisors (see below), whose sum is σ = 375714768. Its totient is φ = 41690880.
The previous prime is 128075323. The next prime is 128075347. The reversal of 128075328 is 823570821.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 128075292 and 128075301.
It is not an unprimeable number, because it can be changed into a prime (128075323) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22183 + ... + 27353.
Almost surely, 2128075328 is an apocalyptic number.
128075328 is a gapful number since it is divisible by the number (18) 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 128075328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187857384).
128075328 is an abundant number, since it is smaller than the sum of its proper divisors (247639440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128075328 is a wasteful number, since it uses less digits than its factorization.
128075328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5232 (or 5219 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 128075328 is about 11317.0370680669. The cubic root of 128075328 is about 504.0672623759.
The spelling of 128075328 in words is "one hundred twenty-eight million, seventy-five thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •