Base | Representation |
---|---|
bin | 110011111001110… |
… | …001010001110000 |
3 | 2020200112022102120 |
4 | 303321301101300 |
5 | 3240410011224 |
6 | 222223514240 |
7 | 30402345135 |
oct | 6371612160 |
9 | 2220468376 |
10 | 870782064 |
11 | 4075964a9 |
12 | 203758980 |
13 | 10b536679 |
14 | 8391258c |
15 | 516a9779 |
hex | 33e71470 |
870782064 has 80 divisors (see below), whose sum is σ = 2329089024. Its totient is φ = 280051200.
The previous prime is 870782063. The next prime is 870782071. The reversal of 870782064 is 460287078.
870782064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×8707820642 = 1516522805968200192, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (870782063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 658524 + ... + 659844.
Almost surely, 2870782064 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 870782064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1164544512).
870782064 is an abundant number, since it is smaller than the sum of its proper divisors (1458306960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
870782064 is a wasteful number, since it uses less digits than its factorization.
870782064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1806 (or 1800 counting only the distinct ones).
The product of its (nonzero) digits is 150528, while the sum is 42.
The square root of 870782064 is about 29509.0166559308. The cubic root of 870782064 is about 954.9262349940.
The spelling of 870782064 in words is "eight hundred seventy million, seven hundred eighty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •