Base | Representation |
---|---|
bin | 1100100001001011… |
… | …10111110000000000 |
3 | 122100101101201201000 |
4 | 12100211313300000 |
5 | 102231012022310 |
6 | 3030522212000 |
7 | 325355656101 |
oct | 62045676000 |
9 | 18311351630 |
10 | 6720814080 |
11 | 29397a7102 |
12 | 1376954000 |
13 | 831514c86 |
14 | 47a8443a8 |
15 | 29506c4c0 |
hex | 190977c00 |
6720814080 has 352 divisors, whose sum is σ = 24306569280. Its totient is φ = 1760624640.
The previous prime is 6720814031. The next prime is 6720814097. The reversal of 6720814080 is 804180276.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 8432242 + ... + 8433038.
Almost surely, 26720814080 is an apocalyptic number.
6720814080 is a gapful number since it is divisible by the number (60) 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 6720814080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12153284640).
6720814080 is an abundant number, since it is smaller than the sum of its proper divisors (17585755200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6720814080 is a wasteful number, since it uses less digits than its factorization.
6720814080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 892 (or 868 counting only the distinct ones).
The product of its (nonzero) digits is 21504, while the sum is 36.
The square root of 6720814080 is about 81980.5713568770. The cubic root of 6720814080 is about 1887.1537910401.
The spelling of 6720814080 in words is "six billion, seven hundred twenty million, eight hundred fourteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •