Search a number
-
+
86050536135059 is a prime number
BaseRepresentation
bin10011100100001100110011…
…101000111001100110010011
3102021200100110211001020012002
4103210030303220321212103
542234322444222310214
6503003023124224215
724060642334521326
oct2344146350714623
9367610424036162
1086050536135059
1125466911351871
12979920653b06b
1339026b90593c2
141736c223947bd
159e358a36b1de
hex4e4333a39993

86050536135059 has 2 divisors, whose sum is σ = 86050536135060. Its totient is φ = 86050536135058.

The previous prime is 86050536135037. The next prime is 86050536135061. The reversal of 86050536135059 is 95053163505068.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 86050536135059 - 28 = 86050536134803 is a prime.

Together with 86050536135061, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 86050536134995 and 86050536135013.

It is not a weakly prime, because it can be changed into another prime (86050536135079) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43025268067529 + 43025268067530.

It is an arithmetic number, because the mean of its divisors is an integer number (43025268067530).

Almost surely, 286050536135059 is an apocalyptic number.

86050536135059 is a deficient number, since it is larger than the sum of its proper divisors (1).

86050536135059 is an equidigital number, since it uses as much as digits as its factorization.

86050536135059 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 14580000, while the sum is 56.

The spelling of 86050536135059 in words is "eighty-six trillion, fifty billion, five hundred thirty-six million, one hundred thirty-five thousand, fifty-nine".