Base | Representation |
---|---|
bin | 1111010011000… |
… | …01110111011010 |
3 | 22221110200201200 |
4 | 13221201313122 |
5 | 230322432010 |
6 | 20422255030 |
7 | 3115522401 |
oct | 751416732 |
9 | 287420650 |
10 | 128327130 |
11 | 6648a088 |
12 | 36b87476 |
13 | 20781219 |
14 | 13086638 |
15 | b3eccc0 |
hex | 7a61dda |
128327130 has 96 divisors (see below), whose sum is σ = 346731840. Its totient is φ = 32904960.
The previous prime is 128327123. The next prime is 128327131. The reversal of 128327130 is 31723821.
It is a junction number, because it is equal to n+sod(n) for n = 128327094 and 128327103.
It is not an unprimeable number, because it can be changed into a prime (128327131) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 306061 + ... + 306479.
It is an arithmetic number, because the mean of its divisors is an integer number (3611790).
Almost surely, 2128327130 is an apocalyptic number.
128327130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 128327130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173365920).
128327130 is an abundant number, since it is smaller than the sum of its proper divisors (218404710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128327130 is a wasteful number, since it uses less digits than its factorization.
128327130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 556 (or 553 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 128327130 is about 11328.1565137493. The cubic root of 128327130 is about 504.3973859506.
The spelling of 128327130 in words is "one hundred twenty-eight million, three hundred twenty-seven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •