11061111050047 has 2 divisors, whose sum is σ = 11061111050048. Its totient is φ = 11061111050046.

The previous prime is 11061111050027. The next prime is 11061111050071. The reversal of 11061111050047 is 74005011116011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11061111050047 - 2³⁹ = 10511355236159 is a prime.

It is a super-2 number, since 2×11061111050047² (a number of 27 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 840, while the sum is 28.

Adding to 11061111050047 its reverse (74005011116011), we get a palindrome (85066122166058).

The spelling of 11061111050047 in words is "eleven trillion, sixty-one billion, one hundred eleven million, fifty thousand, forty-seven".