11361101111 has 2 divisors, whose sum is σ = 11361101112. Its totient is φ = 11361101110.

The previous prime is 11361101093. The next prime is 11361101113. The reversal of 11361101111 is 11110116311.

11361101111 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 a de Polignac number, because none of the positive numbers 2^k-11361101111 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11361101111.

It is a congruent number.

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

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

Almost surely, 2^11361101111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 18, while the sum is 17.

Adding to 11361101111 its reverse (11110116311), we get a palindrome (22471217422).

The spelling of 11361101111 in words is "eleven billion, three hundred sixty-one million, one hundred one thousand, one hundred eleven".