Base | Representation |
---|---|
bin | 101000001100011011… |
… | …1001100111001011101 |
3 | 22020210112122222200212 |
4 | 1100120313030321131 |
5 | 2403234004013403 |
6 | 103353033302205 |
7 | 6144000613415 |
oct | 1203067147135 |
9 | 266715588625 |
10 | 86316469853 |
11 | 336744403a9 |
12 | 1488b264965 |
13 | 81a7947043 |
14 | 426ba07645 |
15 | 23a2cba4d8 |
hex | 1418dcce5d |
86316469853 has 2 divisors, whose sum is σ = 86316469854. Its totient is φ = 86316469852.
The previous prime is 86316469787. The next prime is 86316469891. The reversal of 86316469853 is 35896461368.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66253730404 + 20062739449 = 257398^2 + 141643^2 .
It is a cyclic number.
It is not a de Polignac number, because 86316469853 - 218 = 86316207709 is a prime.
It is a super-3 number, since 3×863164698533 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 86316469792 and 86316469801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (86316469153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43158234926 + 43158234927.
It is an arithmetic number, because the mean of its divisors is an integer number (43158234927).
Almost surely, 286316469853 is an apocalyptic number.
It is an amenable number.
86316469853 is a deficient number, since it is larger than the sum of its proper divisors (1).
86316469853 is an equidigital number, since it uses as much as digits as its factorization.
86316469853 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22394880, while the sum is 59.
The spelling of 86316469853 in words is "eighty-six billion, three hundred sixteen million, four hundred sixty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •