11032311311023 has 32 divisors (see below), whose sum is σ = 11481668352000. Its totient is φ = 10589188229760.

The previous prime is 11032311310981. The next prime is 11032311311033. The reversal of 11032311311023 is 32011311323011.

It is a cyclic number.

It is not a de Polignac number, because 11032311311023 - 2¹⁷ = 11032311179951 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11032311311033) 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 in 31 ways as a sum of consecutive naturals, for example, 3913553508 + ... + 3913556326.

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

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

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

11032311311023 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 4815.

The product of its (nonzero) digits is 324, while the sum is 22.

Adding to 11032311311023 its reverse (32011311323011), we get a palindrome (43043622634034).

The spelling of 11032311311023 in words is "eleven trillion, thirty-two billion, three hundred eleven million, three hundred eleven thousand, twenty-three".