11010011010133 has 2 divisors, whose sum is σ = 11010011010134. Its totient is φ = 11010011010132.

The previous prime is 11010011010017. The next prime is 11010011010137. The reversal of 11010011010133 is 33101011001011.

11010011010133 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., 9871014061489 + 1138996948644 = 3141817^2 + 1067238^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

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

Adding to 11010011010133 its reverse (33101011001011), we get a palindrome (44111022011144).

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