Base | Representation |
---|---|
bin | 1111010011111… |
… | …10101011100000 |
3 | 22221200200121212 |
4 | 13221332223200 |
5 | 230340221102 |
6 | 20425005252 |
7 | 3116523443 |
oct | 751765340 |
9 | 287620555 |
10 | 128445152 |
11 | 6655a820 |
12 | 37023828 |
13 | 207c2b64 |
14 | 130b765a |
15 | b422c52 |
hex | 7a7eae0 |
128445152 has 96 divisors (see below), whose sum is σ = 290304000. Its totient is φ = 55411200.
The previous prime is 128445151. The next prime is 128445157. The reversal of 128445152 is 251544821.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128445151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 861974 + ... + 862122.
It is an arithmetic number, because the mean of its divisors is an integer number (3024000).
Almost surely, 2128445152 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 128445152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145152000).
128445152 is an abundant number, since it is smaller than the sum of its proper divisors (161858848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128445152 is a wasteful number, since it uses less digits than its factorization.
128445152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 280 (or 272 counting only the distinct ones).
The product of its digits is 12800, while the sum is 32.
The square root of 128445152 is about 11333.3645489766. The cubic root of 128445152 is about 504.5519693910.
Adding to 128445152 its reverse (251544821), we get a palindrome (379989973).
The spelling of 128445152 in words is "one hundred twenty-eight million, four hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •