Base | Representation |
---|---|
bin | 1001100110011… |
… | …11100010101000 |
3 | 12121112221200000 |
4 | 10303033202220 |
5 | 131104314424 |
6 | 11554143000 |
7 | 1665410634 |
oct | 463174250 |
9 | 177487600 |
10 | 80541864 |
11 | 41511327 |
12 | 22b81a60 |
13 | 138bcc10 |
14 | a9a7dc4 |
15 | 710e3c9 |
hex | 4ccf8a8 |
80541864 has 96 divisors (see below), whose sum is σ = 243690720. Its totient is φ = 24774336.
The previous prime is 80541863. The next prime is 80541887. The reversal of 80541864 is 46814508.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80541863) by changing a digit.
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, 23679 + ... + 26865.
It is an arithmetic number, because the mean of its divisors is an integer number (2538445).
Almost surely, 280541864 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 80541864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121845360).
80541864 is an abundant number, since it is smaller than the sum of its proper divisors (163148856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80541864 is a wasteful number, since it uses less digits than its factorization.
80541864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3221 (or 3205 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 36.
The square root of 80541864 is about 8974.5119087335. The cubic root of 80541864 is about 431.8575919495.
The spelling of 80541864 in words is "eighty million, five hundred forty-one thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •