11010152011 has 2 divisors, whose sum is σ = 11010152012. Its totient is φ = 11010152010.

The previous prime is 11010151993. The next prime is 11010152039. The reversal of 11010152011 is 11025101011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11010152011 - 2⁵ = 11010151979 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11010151982 and 11010152000.

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

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

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

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

Almost surely, 2^11010152011 is an apocalyptic number.

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

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

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

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

Adding to 11010152011 its reverse (11025101011), we get a palindrome (22035253022).

The spelling of 11010152011 in words is "eleven billion, ten million, one hundred fifty-two thousand, eleven".