Base | Representation |
---|---|
bin | 1111010101001… |
… | …01001001000000 |
3 | 22221222200201112 |
4 | 13222211021000 |
5 | 230410241223 |
6 | 20432222452 |
7 | 3121050644 |
oct | 752451100 |
9 | 287880645 |
10 | 128602688 |
11 | 66658115 |
12 | 3709aa28 |
13 | 20849786 |
14 | 13118c24 |
15 | b454778 |
hex | 7aa5240 |
128602688 has 56 divisors (see below), whose sum is σ = 271805400. Its totient is φ = 60370944.
The previous prime is 128602687. The next prime is 128602699. The reversal of 128602688 is 886206821.
It can be written as a sum of positive squares in 4 ways, for example, as 51724864 + 76877824 = 7192^2 + 8768^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128602687) 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 7 ways as a sum of consecutive naturals, for example, 314228 + ... + 314636.
Almost surely, 2128602688 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 128602688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135902700).
128602688 is an abundant number, since it is smaller than the sum of its proper divisors (143202712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128602688 is an frugal number, since it uses more digits than its factorization.
128602688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472 (or 428 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 41.
The square root of 128602688 is about 11340.3125177395. The cubic root of 128602688 is about 504.7581601897.
The spelling of 128602688 in words is "one hundred twenty-eight million, six hundred two thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •