Base | Representation |
---|---|
bin | 110000001111000… |
… | …000011100000000 |
3 | 2002101201200000201 |
4 | 300033000130000 |
5 | 3124131142240 |
6 | 212144454544 |
7 | 26024300140 |
oct | 6017003400 |
9 | 2071650021 |
10 | 809240320 |
11 | 385882259 |
12 | 1a701a454 |
13 | cb869a35 |
14 | 79692920 |
15 | 4b09ed9a |
hex | 303c0700 |
809240320 has 144 divisors (see below), whose sum is σ = 2276100288. Its totient is φ = 269844480.
The previous prime is 809240309. The next prime is 809240351. The reversal of 809240320 is 23042908.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a zygodrome in base 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 330300 + ... + 332740.
It is an arithmetic number, because the mean of its divisors is an integer number (15806252).
Almost surely, 2809240320 is an apocalyptic number.
809240320 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 809240320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1138050144).
809240320 is an abundant number, since it is smaller than the sum of its proper divisors (1466859968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
809240320 is a wasteful number, since it uses less digits than its factorization.
809240320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2506 (or 2492 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 809240320 is about 28447.1495935885. The cubic root of 809240320 is about 931.8782405852.
The spelling of 809240320 in words is "eight hundred nine million, two hundred forty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •