Base | Representation |
---|---|
bin | 100101011110101100… |
… | …1001000111000000000 |
3 | 21200202021021220111222 |
4 | 1022331121020320000 |
5 | 2304314121120404 |
6 | 100550345254212 |
7 | 5546353214600 |
oct | 1127531107000 |
9 | 250667256458 |
10 | 80486895104 |
11 | 31152832630 |
12 | 13722a94368 |
13 | 7788c7c025 |
14 | 3c776bcc00 |
15 | 21610e8dbe |
hex | 12bd648e00 |
80486895104 has 480 divisors, whose sum is σ = 215377509600. Its totient is φ = 29672079360.
The previous prime is 80486895101. The next prime is 80486895107. The reversal of 80486895104 is 40159868408.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (80486895101) and next prime (80486895107).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80486895101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 712273352 + ... + 712273464.
It is an arithmetic number, because the mean of its divisors is an integer number (448703145).
Almost surely, 280486895104 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 80486895104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107688754800).
80486895104 is an abundant number, since it is smaller than the sum of its proper divisors (134890614496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80486895104 is a wasteful number, since it uses less digits than its factorization.
80486895104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274 (or 251 counting only the distinct ones).
The product of its (nonzero) digits is 2211840, while the sum is 53.
The spelling of 80486895104 in words is "eighty billion, four hundred eighty-six million, eight hundred ninety-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •