Base | Representation |
---|---|
bin | 1010001101011… |
… | …00001101101001 |
3 | 12222010222001101 |
4 | 11012230031221 |
5 | 133410440131 |
6 | 12255321401 |
7 | 2056633264 |
oct | 506541551 |
9 | 188128041 |
10 | 85640041 |
11 | 443836a3 |
12 | 24820261 |
13 | 149865a6 |
14 | b533cdb |
15 | 77b9c61 |
hex | 51ac369 |
85640041 has 4 divisors (see below), whose sum is σ = 85748292. Its totient is φ = 85531792.
The previous prime is 85639993. The next prime is 85640057. The reversal of 85640041 is 14004658.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21576025 + 64064016 = 4645^2 + 8004^2 .
It is a cyclic number.
It is not a de Polignac number, because 85640041 - 221 = 83542889 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 85639991 and 85640009.
It is not an unprimeable number, because it can be changed into a prime (85640081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52930 + ... + 54523.
It is an arithmetic number, because the mean of its divisors is an integer number (21437073).
Almost surely, 285640041 is an apocalyptic number.
It is an amenable number.
85640041 is a deficient number, since it is larger than the sum of its proper divisors (108251).
85640041 is a wasteful number, since it uses less digits than its factorization.
85640041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108250.
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 85640041 is about 9254.1904562204. The cubic root of 85640041 is about 440.7837975062.
Adding to 85640041 its reverse (14004658), we get a palindrome (99644699).
The spelling of 85640041 in words is "eighty-five million, six hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •