11011220101111 has 2 divisors, whose sum is σ = 11011220101112. Its totient is φ = 11011220101110.

The previous prime is 11011220101093. The next prime is 11011220101117. The reversal of 11011220101111 is 11110102211011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11011220101111 - 2¹³ = 11011220092919 is a prime.

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

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

It is a congruent number.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 13.

Adding to 11011220101111 its reverse (11110102211011), we get a palindrome (22121322312122).

The spelling of 11011220101111 in words is "eleven trillion, eleven billion, two hundred twenty million, one hundred one thousand, one hundred eleven".