11010010011157 has 2 divisors, whose sum is σ = 11010010011158. Its totient is φ = 11010010011156.

The previous prime is 11010010011107. The next prime is 11010010011167. The reversal of 11010010011157 is 75111001001011.

11010010011157 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 can be written as a sum of positive squares in only one way, i.e., 10376702821521 + 633307189636 = 3221289^2 + 795806^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 35, while the sum is 19.

Adding to 11010010011157 its reverse (75111001001011), we get a palindrome (86121011012168).

The spelling of 11010010011157 in words is "eleven trillion, ten billion, ten million, eleven thousand, one hundred fifty-seven".