Base | Representation |
---|---|
bin | 1010011100001100… |
… | …1110010011000000 |
3 | 21020022122212101212 |
4 | 2213003032103000 |
5 | 21214433440224 |
6 | 1142034145252 |
7 | 126311022200 |
oct | 24703162300 |
9 | 7208585355 |
10 | 2802640064 |
11 | 1209020a64 |
12 | 662722228 |
13 | 358842b03 |
14 | 1c8310400 |
15 | 1160abd0e |
hex | a70ce4c0 |
2802640064 has 168 divisors, whose sum is σ = 6760415232. Its totient is φ = 1148152320.
The previous prime is 2802640051. The next prime is 2802640097. The reversal of 2802640064 is 4600462082.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 2802640064.
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 23 ways as a sum of consecutive naturals, for example, 12346319 + ... + 12346545.
Almost surely, 22802640064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2802640064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3380207616).
2802640064 is an abundant number, since it is smaller than the sum of its proper divisors (3957775168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2802640064 is a wasteful number, since it uses less digits than its factorization.
2802640064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411 (or 394 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 32.
The square root of 2802640064 is about 52939.9666036918. The cubic root of 2802640064 is about 1409.9025910609.
The spelling of 2802640064 in words is "two billion, eight hundred two million, six hundred forty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •