Base | Representation |
---|---|
bin | 1010010001101… |
… | …00001001110100 |
3 | 20000012020212000 |
4 | 11020310021310 |
5 | 134031244402 |
6 | 12315255300 |
7 | 2064442530 |
oct | 510641164 |
9 | 200166760 |
10 | 86196852 |
11 | 44723a75 |
12 | 24a4a530 |
13 | 14b1cb71 |
14 | b63abc0 |
15 | 7879c1c |
hex | 5234274 |
86196852 has 96 divisors (see below), whose sum is σ = 257913600. Its totient is φ = 24385536.
The previous prime is 86196839. The next prime is 86196853. The reversal of 86196852 is 25869168.
It is a junction number, because it is equal to n+sod(n) for n = 86196798 and 86196807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86196853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84924 + ... + 85932.
It is an arithmetic number, because the mean of its divisors is an integer number (2686600).
Almost surely, 286196852 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 86196852, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128956800).
86196852 is an abundant number, since it is smaller than the sum of its proper divisors (171716748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
86196852 is a wasteful number, since it uses less digits than its factorization.
86196852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1142 (or 1134 counting only the distinct ones).
The product of its digits is 207360, while the sum is 45.
The square root of 86196852 is about 9284.2259774308. The cubic root of 86196852 is about 441.7370247629.
The spelling of 86196852 in words is "eighty-six million, one hundred ninety-six thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •