Base | Representation |
---|---|
bin | 1010001011010… |
… | …00101000100101 |
3 | 12221121220100101 |
4 | 11011220220211 |
5 | 133323110422 |
6 | 12245344101 |
7 | 2054401261 |
oct | 505505045 |
9 | 187556311 |
10 | 85363237 |
11 | 44204733 |
12 | 24708031 |
13 | 148ba5bb |
14 | b4a10a1 |
15 | 7762c27 |
hex | 5168a25 |
85363237 has 2 divisors, whose sum is σ = 85363238. Its totient is φ = 85363236.
The previous prime is 85363183. The next prime is 85363247. The reversal of 85363237 is 73236358.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67798756 + 17564481 = 8234^2 + 4191^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-85363237 is a prime.
It is a super-2 number, since 2×853632372 = 14573764462236338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 85363196 and 85363205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (85363247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 42681618 + 42681619.
It is an arithmetic number, because the mean of its divisors is an integer number (42681619).
Almost surely, 285363237 is an apocalyptic number.
It is an amenable number.
85363237 is a deficient number, since it is larger than the sum of its proper divisors (1).
85363237 is an equidigital number, since it uses as much as digits as its factorization.
85363237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 90720, while the sum is 37.
The square root of 85363237 is about 9239.2227486948. Note that the first 3 decimals coincide. The cubic root of 85363237 is about 440.3083874569.
The spelling of 85363237 in words is "eighty-five million, three hundred sixty-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •