Base | Representation |
---|---|
bin | 110010110101111… |
… | …110100101000000 |
3 | 2012110002102202211 |
4 | 302311332211000 |
5 | 3221332321002 |
6 | 220350551504 |
7 | 30065320546 |
oct | 6265764500 |
9 | 2173072684 |
10 | 853010752 |
11 | 3a8558670 |
12 | 1b9808594 |
13 | 1079537b9 |
14 | 81407d96 |
15 | 4ed48dd7 |
hex | 32d7e940 |
853010752 has 112 divisors (see below), whose sum is σ = 1945843200. Its totient is φ = 367234560.
The previous prime is 853010749. The next prime is 853010759. The reversal of 853010752 is 257010358.
853010752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (853010759) 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, 2250499 + ... + 2250877.
It is an arithmetic number, because the mean of its divisors is an integer number (17373600).
Almost surely, 2853010752 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 853010752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (972921600).
853010752 is an abundant number, since it is smaller than the sum of its proper divisors (1092832448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
853010752 is a wasteful number, since it uses less digits than its factorization.
853010752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564 (or 554 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 853010752 is about 29206.3478031746. The cubic root of 853010752 is about 948.3853466145.
The spelling of 853010752 in words is "eight hundred fifty-three million, ten thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •