110100101011133 has 2 divisors, whose sum is σ = 110100101011134. Its totient is φ = 110100101011132.

The previous prime is 110100101011093. The next prime is 110100101011151. The reversal of 110100101011133 is 331110101001011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109991809339204 + 108291671929 = 10487698^2 + 329077^2 .

It is a cyclic number.

It is not a de Polignac number, because 110100101011133 - 2²⁶ = 110100033902269 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

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

It is an amenable number.

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

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

110100101011133 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 14.

Adding to 110100101011133 its reverse (331110101001011), we get a palindrome (441210202012144).

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