Base | Representation |
---|---|
bin | 1111010001000… |
… | …11101100010010 |
3 | 22220222202101200 |
4 | 13220203230102 |
5 | 230241304331 |
6 | 20413012030 |
7 | 3113412054 |
oct | 750435422 |
9 | 286882350 |
10 | 128072466 |
11 | 66325815 |
12 | 36a84016 |
13 | 206c2332 |
14 | 1301b8d4 |
15 | b39c5e6 |
hex | 7a23b12 |
128072466 has 48 divisors (see below), whose sum is σ = 287911104. Its totient is φ = 41111712.
The previous prime is 128072453. The next prime is 128072471. The reversal of 128072466 is 664270821.
128072466 is a `hidden beast` number, since 128 + 0 + 72 + 466 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 128072466.
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, 67665 + ... + 69531.
It is an arithmetic number, because the mean of its divisors is an integer number (5998148).
Almost surely, 2128072466 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 128072466, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143955552).
128072466 is an abundant number, since it is smaller than the sum of its proper divisors (159838638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128072466 is a wasteful number, since it uses less digits than its factorization.
128072466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2015 (or 2012 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 128072466 is about 11316.9106208364. The cubic root of 128072466 is about 504.0635076813.
The spelling of 128072466 in words is "one hundred twenty-eight million, seventy-two thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •