Base | Representation |
---|---|
bin | 111011110101100111… |
… | …0001000100000011000 |
3 | 110021200102011210011120 |
4 | 1313223032020200120 |
5 | 4101132100332300 |
6 | 135010545325240 |
7 | 12166234253052 |
oct | 1675316104030 |
9 | 407612153146 |
10 | 128500402200 |
11 | 4a551144105 |
12 | 20aa2636820 |
13 | c16b2c3661 |
14 | 631026c8d2 |
15 | 35213983a0 |
hex | 1deb388818 |
128500402200 has 96 divisors (see below), whose sum is σ = 398621547600. Its totient is φ = 34243522560.
The previous prime is 128500402187. The next prime is 128500402229. The reversal of 128500402200 is 2204005821.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 821484 + ... + 965316.
Almost surely, 2128500402200 is an apocalyptic number.
128500402200 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 128500402200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (199310773800).
128500402200 is an abundant number, since it is smaller than the sum of its proper divisors (270121145400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128500402200 is a wasteful number, since it uses less digits than its factorization.
128500402200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145341 (or 145332 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 24.
The spelling of 128500402200 in words is "one hundred twenty-eight billion, five hundred million, four hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •