11011010141 has 2 divisors, whose sum is σ = 11011010142. Its totient is φ = 11011010140.

The previous prime is 11011010137. The next prime is 11011010149. The reversal of 11011010141 is 14101011011.

It is a happy number.

11011010141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10558384516 + 452625625 = 102754^2 + 21275^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011010141 - 2² = 11011010137 is a prime.

It is a congruent number.

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

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

Almost surely, 2^11011010141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 11011010141 its reverse (14101011011), we get a palindrome (25112021152).

The spelling of 11011010141 in words is "eleven billion, eleven million, ten thousand, one hundred forty-one".