Base | Representation |
---|---|
bin | 1111010001100… |
… | …10011010000000 |
3 | 22221002211001220 |
4 | 13220302122000 |
5 | 230300221421 |
6 | 20414155040 |
7 | 3114052554 |
oct | 750623200 |
9 | 287084056 |
10 | 128132736 |
11 | 66367026 |
12 | 36ab2a80 |
13 | 207138b4 |
14 | 13035864 |
15 | b3b03c6 |
hex | 7a32680 |
128132736 has 32 divisors (see below), whose sum is σ = 340353600. Its totient is φ = 42710784.
The previous prime is 128132731. The next prime is 128132737. The reversal of 128132736 is 637231821.
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 128132697 and 128132706.
It is not an unprimeable number, because it can be changed into a prime (128132731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 166456 + ... + 167223.
It is an arithmetic number, because the mean of its divisors is an integer number (10636050).
Almost surely, 2128132736 is an apocalyptic number.
128132736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
128132736 is an abundant number, since it is smaller than the sum of its proper divisors (212220864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128132736 is an equidigital number, since it uses as much as digits as its factorization.
128132736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333696 (or 333684 counting only the distinct ones).
The product of its digits is 12096, while the sum is 33.
The square root of 128132736 is about 11319.5731368281. The cubic root of 128132736 is about 504.1425648596.
The spelling of 128132736 in words is "one hundred twenty-eight million, one hundred thirty-two thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •