Base | Representation |
---|---|
bin | 1010010001000… |
… | …00100101011101 |
3 | 20000001011220110 |
4 | 11020200211131 |
5 | 134021213301 |
6 | 12313440233 |
7 | 2063660046 |
oct | 510404535 |
9 | 200034813 |
10 | 86116701 |
11 | 44679830 |
12 | 24a10079 |
13 | 14ac2538 |
14 | b6198cd |
15 | 78610d6 |
hex | 522095d |
86116701 has 8 divisors (see below), whose sum is σ = 125260704. Its totient is φ = 52191920.
The previous prime is 86116699. The next prime is 86116717. The reversal of 86116701 is 10761168.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 86116701 - 21 = 86116699 is a prime.
It is a super-3 number, since 3×861167013 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86117701) 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 7 ways as a sum of consecutive naturals, for example, 1304766 + ... + 1304831.
It is an arithmetic number, because the mean of its divisors is an integer number (15657588).
Almost surely, 286116701 is an apocalyptic number.
It is an amenable number.
86116701 is a deficient number, since it is larger than the sum of its proper divisors (39144003).
86116701 is a wasteful number, since it uses less digits than its factorization.
86116701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609611.
The product of its (nonzero) digits is 2016, while the sum is 30.
The square root of 86116701 is about 9279.9084586002. The cubic root of 86116701 is about 441.6000644478.
Adding to 86116701 its reverse (10761168), we get a palindrome (96877869).
The spelling of 86116701 in words is "eighty-six million, one hundred sixteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •