Base | Representation |
---|---|
bin | 110000010001110… |
… | …010001101100000 |
3 | 2002110002122212121 |
4 | 300101302031200 |
5 | 3124322442410 |
6 | 212212234024 |
7 | 26033422066 |
oct | 6021621540 |
9 | 2073078777 |
10 | 809968480 |
11 | 38622a342 |
12 | 1a730b914 |
13 | cba632b9 |
14 | 79802036 |
15 | 4b1959da |
hex | 30472360 |
809968480 has 144 divisors (see below), whose sum is σ = 2079619920. Its totient is φ = 297851904.
The previous prime is 809968469. The next prime is 809968513. The reversal of 809968480 is 84869908.
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 23 ways as a sum of consecutive naturals, for example, 2136931 + ... + 2137309.
It is an arithmetic number, because the mean of its divisors is an integer number (14441805).
Almost surely, 2809968480 is an apocalyptic number.
809968480 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 809968480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1039809960).
809968480 is an abundant number, since it is smaller than the sum of its proper divisors (1269651440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
809968480 is a wasteful number, since it uses less digits than its factorization.
809968480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469 (or 442 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 52.
The square root of 809968480 is about 28459.9451861735. The cubic root of 809968480 is about 932.1576602752.
The spelling of 809968480 in words is "eight hundred nine million, nine hundred sixty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •