111100000110133 has 2 divisors, whose sum is σ = 111100000110134. Its totient is φ = 111100000110132.

The previous prime is 111100000110103. The next prime is 111100000110137. The reversal of 111100000110133 is 331011000001111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91964685991684 + 19135314118449 = 9589822^2 + 4374393^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 111100000110133 its reverse (331011000001111), we get a palindrome (442111000111244).

The spelling of 111100000110133 in words is "one hundred eleven trillion, one hundred billion, one hundred ten thousand, one hundred thirty-three".