Base | Representation |
---|---|
bin | 111101100000111… |
… | …0100000001101000 |
3 | 12022211220202121001 |
4 | 1323001310001220 |
5 | 13211400312213 |
6 | 540452124344 |
7 | 102102220660 |
oct | 17301640150 |
9 | 5284822531 |
10 | 2064072808 |
11 | 96a12a4a6 |
12 | 4973066b4 |
13 | 26b81c075 |
14 | 1581b71a0 |
15 | c131c1dd |
hex | 7b074068 |
2064072808 has 64 divisors (see below), whose sum is σ = 4680529920. Its totient is φ = 834187200.
The previous prime is 2064072779. The next prime is 2064072823. The reversal of 2064072808 is 8082704602.
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 15 ways as a sum of consecutive naturals, for example, 80163 + ... + 102733.
It is an arithmetic number, because the mean of its divisors is an integer number (73133280).
Almost surely, 22064072808 is an apocalyptic number.
2064072808 is a gapful number since it is divisible by the number (28) 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 2064072808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2340264960).
2064072808 is an abundant number, since it is smaller than the sum of its proper divisors (2616457112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064072808 is a wasteful number, since it uses less digits than its factorization.
2064072808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22678 (or 22674 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 37.
The square root of 2064072808 is about 45432.0680577057. The cubic root of 2064072808 is about 1273.2343229271.
The spelling of 2064072808 in words is "two billion, sixty-four million, seventy-two thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •