Base | Representation |
---|---|
bin | 1111010010010… |
… | …01010110001100 |
3 | 22221021120222001 |
4 | 13221021112030 |
5 | 230311223300 |
6 | 20420202044 |
7 | 3114623530 |
oct | 751112614 |
9 | 287246861 |
10 | 128226700 |
11 | 66420688 |
12 | 36b39324 |
13 | 207475b4 |
14 | 1305bbc0 |
15 | b3cd16a |
hex | 7a4958c |
128226700 has 72 divisors (see below), whose sum is σ = 321979392. Its totient is φ = 43414080.
The previous prime is 128226673. The next prime is 128226737. The reversal of 128226700 is 7622821.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 56997 + ... + 59203.
It is an arithmetic number, because the mean of its divisors is an integer number (4471936).
Almost surely, 2128226700 is an apocalyptic number.
128226700 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 128226700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160989696).
128226700 is an abundant number, since it is smaller than the sum of its proper divisors (193752692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128226700 is a wasteful number, since it uses less digits than its factorization.
128226700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2311 (or 2304 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 128226700 is about 11323.7228860477. The cubic root of 128226700 is about 504.2657695885.
The spelling of 128226700 in words is "one hundred twenty-eight million, two hundred twenty-six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •