Base | Representation |
---|---|
bin | 110000111001011… |
… | …100001110000000 |
3 | 2010011122211001210 |
4 | 300321130032000 |
5 | 3140003123120 |
6 | 213223130120 |
7 | 26220660150 |
oct | 6071341600 |
9 | 2104584053 |
10 | 820364160 |
11 | 39108a810 |
12 | 1aa8a3940 |
13 | 100c62ca5 |
14 | 7ad4a760 |
15 | 4c04ace0 |
hex | 30e5c380 |
820364160 has 512 divisors, whose sum is σ = 3384115200. Its totient is φ = 164044800.
The previous prime is 820364137. The next prime is 820364201. The reversal of 820364160 is 61463028.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4582951 + ... + 4583129.
It is an arithmetic number, because the mean of its divisors is an integer number (6609600).
Almost surely, 2820364160 is an apocalyptic number.
820364160 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 820364160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1692057600).
820364160 is an abundant number, since it is smaller than the sum of its proper divisors (2563751040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
820364160 is a wasteful number, since it uses less digits than its factorization.
820364160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250 (or 238 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 820364160 is about 28641.9999301725. Note that the first 4 decimals coincide. The cubic root of 820364160 is about 936.1286987910.
The spelling of 820364160 in words is "eight hundred twenty million, three hundred sixty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •