Base | Representation |
---|---|
bin | 110010110100110… |
… | …111100101100000 |
3 | 2012102112122220001 |
4 | 302310313211200 |
5 | 3221244014333 |
6 | 220340425344 |
7 | 30063000022 |
oct | 6264674540 |
9 | 2172478801 |
10 | 852719968 |
11 | 3a837a151 |
12 | 1b96a8254 |
13 | 107881339 |
14 | 81370012 |
15 | 4ecdcb7d |
hex | 32d37960 |
852719968 has 48 divisors (see below), whose sum is σ = 1752329376. Its totient is φ = 408079360.
The previous prime is 852719957. The next prime is 852719969. The reversal of 852719968 is 869917258.
852719968 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 (852719969) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63405 + ... + 75667.
It is an arithmetic number, because the mean of its divisors is an integer number (36506862).
Almost surely, 2852719968 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 852719968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (876164688).
852719968 is an abundant number, since it is smaller than the sum of its proper divisors (899609408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
852719968 is a wasteful number, since it uses less digits than its factorization.
852719968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12367 (or 12359 counting only the distinct ones).
The product of its digits is 2177280, while the sum is 55.
The square root of 852719968 is about 29201.3692829634. The cubic root of 852719968 is about 948.2775689081.
The spelling of 852719968 in words is "eight hundred fifty-two million, seven hundred nineteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •