Base | Representation |
---|---|
bin | 1010010011000… |
… | …00010101111101 |
3 | 20000112110010202 |
4 | 11021200111331 |
5 | 134103042403 |
6 | 12323213245 |
7 | 2066125322 |
oct | 511402575 |
9 | 200473122 |
10 | 86377853 |
11 | 44837a61 |
12 | 24b17225 |
13 | 14b84373 |
14 | b686b49 |
15 | 78b3688 |
hex | 526057d |
86377853 has 2 divisors, whose sum is σ = 86377854. Its totient is φ = 86377852.
The previous prime is 86377843. The next prime is 86377861. The reversal of 86377853 is 35877368.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58951684 + 27426169 = 7678^2 + 5237^2 .
It is a cyclic number.
It is not a de Polignac number, because 86377853 - 224 = 69600637 is a prime.
It is a super-2 number, since 2×863778532 = 14922266977779218, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 86377798 and 86377807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (86377843) 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 as a sum of consecutive naturals, namely, 43188926 + 43188927.
It is an arithmetic number, because the mean of its divisors is an integer number (43188927).
Almost surely, 286377853 is an apocalyptic number.
It is an amenable number.
86377853 is a deficient number, since it is larger than the sum of its proper divisors (1).
86377853 is an equidigital number, since it uses as much as digits as its factorization.
86377853 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 846720, while the sum is 47.
The square root of 86377853 is about 9293.9686356260. The cubic root of 86377853 is about 442.0460033470.
The spelling of 86377853 in words is "eighty-six million, three hundred seventy-seven thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •