11011111101013 has 2 divisors, whose sum is σ = 11011111101014. Its totient is φ = 11011111101012.

The previous prime is 11011111100987. The next prime is 11011111101049. The reversal of 11011111101013 is 31010111111011.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6258392815684 + 4752718285329 = 2501678^2 + 2180073^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 11011111101013 its reverse (31010111111011), we get a palindrome (42021222212024).

The spelling of 11011111101013 in words is "eleven trillion, eleven billion, one hundred eleven million, one hundred one thousand, thirteen".