69556911157 has 2 divisors, whose sum is σ = 69556911158. Its totient is φ = 69556911156.

The previous prime is 69556911131. The next prime is 69556911161. The reversal of 69556911157 is 75111965596.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69548765841 + 8145316 = 263721^2 + 2854^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-69556911157 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (69556915157) 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, 34778455578 + 34778455579.

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

Almost surely, 2^69556911157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2551500, while the sum is 55.

The spelling of 69556911157 in words is "sixty-nine billion, five hundred fifty-six million, nine hundred eleven thousand, one hundred fifty-seven".