Base | Representation |
---|---|
bin | 10011110001010111011110… |
… | …010000110101111110110111 |
3 | 102101212211221021122200102001 |
4 | 103301113132100311332313 |
5 | 42344134020004134022 |
6 | 504534422123200131 |
7 | 24213213301365106 |
oct | 2361273620657667 |
9 | 371784837580361 |
10 | 86955341864887 |
11 | 2578560a61a601 |
12 | 9904640076047 |
13 | 3969b13344b12 |
14 | 1768937b0c03d |
15 | a0bd94727b27 |
hex | 4f15de435fb7 |
86955341864887 has 2 divisors, whose sum is σ = 86955341864888. Its totient is φ = 86955341864886.
The previous prime is 86955341864827. The next prime is 86955341864929. The reversal of 86955341864887 is 78846814355968.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 86955341864887 - 227 = 86955207647159 is a prime.
It is a super-2 number, since 2×869553418648872 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 86955341864887.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (86955341864827) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43477670932443 + 43477670932444.
It is an arithmetic number, because the mean of its divisors is an integer number (43477670932444).
Almost surely, 286955341864887 is an apocalyptic number.
86955341864887 is a deficient number, since it is larger than the sum of its proper divisors (1).
86955341864887 is an equidigital number, since it uses as much as digits as its factorization.
86955341864887 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11147673600, while the sum is 82.
The spelling of 86955341864887 in words is "eighty-six trillion, nine hundred fifty-five billion, three hundred forty-one million, eight hundred sixty-four thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •