Base | Representation |
---|---|
bin | 1010001101100… |
… | …01100001100101 |
3 | 12222012001220011 |
4 | 11012301201211 |
5 | 133412134142 |
6 | 12300010221 |
7 | 2060053564 |
oct | 506614145 |
9 | 188161804 |
10 | 85661797 |
11 | 44398a81 |
12 | 24830971 |
13 | 14993470 |
14 | b53bbdb |
15 | 77c1417 |
hex | 51b1865 |
85661797 has 8 divisors (see below), whose sum is σ = 93069144. Its totient is φ = 78371328.
The previous prime is 85661791. The next prime is 85661803. The reversal of 85661797 is 79716658.
It is an interprime number because it is at equal distance from previous prime (85661791) and next prime (85661803).
It can be written as a sum of positive squares in 4 ways, for example, as 25281 + 85636516 = 159^2 + 9254^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 85661797 - 23 = 85661789 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 85661797.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85661791) 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, 27688 + ... + 30625.
It is an arithmetic number, because the mean of its divisors is an integer number (11633643).
Almost surely, 285661797 is an apocalyptic number.
It is an amenable number.
85661797 is a deficient number, since it is larger than the sum of its proper divisors (7407347).
85661797 is a wasteful number, since it uses less digits than its factorization.
85661797 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58439.
The product of its digits is 635040, while the sum is 49.
The square root of 85661797 is about 9255.3658490629. The cubic root of 85661797 is about 440.8211199248.
The spelling of 85661797 in words is "eighty-five million, six hundred sixty-one thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •