Base | Representation |
---|---|
bin | 101000011010101100… |
… | …0001000110100111101 |
3 | 22022000212212000210222 |
4 | 1100311120020310331 |
5 | 2410223441202411 |
6 | 103512323111125 |
7 | 6161600121335 |
oct | 1206530106475 |
9 | 268025760728 |
10 | 86794865981 |
11 | 3389a4914aa |
12 | 149a35124a5 |
13 | 8252aa6985 |
14 | 42b53780c5 |
15 | 23cecb74db |
hex | 1435608d3d |
86794865981 has 2 divisors, whose sum is σ = 86794865982. Its totient is φ = 86794865980.
The previous prime is 86794865891. The next prime is 86794866023. The reversal of 86794865981 is 18956849768.
Together with previous prime (86794865891) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86438940025 + 355925956 = 294005^2 + 18866^2 .
It is a cyclic number.
It is not a de Polignac number, because 86794865981 - 226 = 86727757117 is a prime.
It is a super-2 number, since 2×867948659812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (86794865681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43397432990 + 43397432991.
It is an arithmetic number, because the mean of its divisors is an integer number (43397432991).
Almost surely, 286794865981 is an apocalyptic number.
It is an amenable number.
86794865981 is a deficient number, since it is larger than the sum of its proper divisors (1).
86794865981 is an equidigital number, since it uses as much as digits as its factorization.
86794865981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 209018880, while the sum is 71.
The spelling of 86794865981 in words is "eighty-six billion, seven hundred ninety-four million, eight hundred sixty-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •