Base | Representation |
---|---|
bin | 1001100011100… |
… | …10011110000000 |
3 | 12120211120201121 |
4 | 10301302132000 |
5 | 131010120030 |
6 | 11542042024 |
7 | 1662232330 |
oct | 461623600 |
9 | 176746647 |
10 | 80160640 |
11 | 4128096a |
12 | 22a19314 |
13 | 137b8541 |
14 | a9090c0 |
15 | 708647a |
hex | 4c72780 |
80160640 has 128 divisors (see below), whose sum is σ = 226929600. Its totient is φ = 26492928.
The previous prime is 80160607. The next prime is 80160667. The reversal of 80160640 is 4606108.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129612 + ... + 130228.
Almost surely, 280160640 is an apocalyptic number.
80160640 is a gapful number since it is divisible by the number (80) 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 80160640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113464800).
80160640 is an abundant number, since it is smaller than the sum of its proper divisors (146768960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80160640 is a wasteful number, since it uses less digits than its factorization.
80160640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672 (or 660 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 80160640 is about 8953.2474555325. The cubic root of 80160640 is about 431.1751521715.
Adding to 80160640 its reverse (4606108), we get a palindrome (84766748).
The spelling of 80160640 in words is "eighty million, one hundred sixty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •