11560415560139 has 2 divisors, whose sum is σ = 11560415560140. Its totient is φ = 11560415560138.

The previous prime is 11560415560093. The next prime is 11560415560157. The reversal of 11560415560139 is 93106551406511.

11560415560139 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11560415560139 - 2²⁰ = 11560414511563 is a prime.

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

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

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

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

Almost surely, 2^{11560415560139} is an apocalyptic number.

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

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

11560415560139 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 486000, while the sum is 47.

The spelling of 11560415560139 in words is "eleven trillion, five hundred sixty billion, four hundred fifteen million, five hundred sixty thousand, one hundred thirty-nine".