Base | Representation |
---|---|
bin | 1111010001110… |
… | …00100111111000 |
3 | 22221011010000000 |
4 | 13220320213320 |
5 | 230302030300 |
6 | 20414513000 |
7 | 3114220032 |
oct | 750704770 |
9 | 287133000 |
10 | 128158200 |
11 | 66384175 |
12 | 36b05760 |
13 | 20722371 |
14 | 13040c52 |
15 | b3b7c00 |
hex | 7a389f8 |
128158200 has 192 divisors, whose sum is σ = 448408800. Its totient is φ = 34058880.
The previous prime is 128158171. The next prime is 128158201. The reversal of 128158200 is 2851821.
128158200 is a `hidden beast` number, since 1 + 2 + 81 + 582 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128158201) 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, 437254 + ... + 437546.
Almost surely, 2128158200 is an apocalyptic number.
128158200 is a gapful number since it is divisible by the number (10) 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 128158200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224204400).
128158200 is an abundant number, since it is smaller than the sum of its proper divisors (320250600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128158200 is an equidigital number, since it uses as much as digits as its factorization.
128158200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330 (or 303 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 27.
The square root of 128158200 is about 11320.6978583478. The cubic root of 128158200 is about 504.1759589693.
The spelling of 128158200 in words is "one hundred twenty-eight million, one hundred fifty-eight thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •