11110010111153 has 2 divisors, whose sum is σ = 11110010111154. Its totient is φ = 11110010111152.

The previous prime is 11110010111131. The next prime is 11110010111159. The reversal of 11110010111153 is 35111101001111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9130380809104 + 1979629302049 = 3021652^2 + 1406993^2 .

It is a cyclic number.

It is not a de Polignac number, because 11110010111153 - 2⁸ = 11110010110897 is a prime.

It is a super-3 number, since 3×11110010111153³ (a number of 40 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

It is an amenable number.

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

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

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

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

Adding to 11110010111153 its reverse (35111101001111), we get a palindrome (46221111112264).

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