2911011101093 has 2 divisors, whose sum is σ = 2911011101094. Its totient is φ = 2911011101092.

The previous prime is 2911011101041. The next prime is 2911011101143. The reversal of 2911011101093 is 3901011101192.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2607314219524 + 303696881569 = 1614718^2 + 551087^2 .

It is a cyclic number.

It is not a de Polignac number, because 2911011101093 - 2⁶ = 2911011101029 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 29.

Subtracting 2911011101093 from its reverse (3901011101192), we obtain a palindrome (990000000099).

The spelling of 2911011101093 in words is "two trillion, nine hundred eleven billion, eleven million, one hundred one thousand, ninety-three".