11050505005605 has 128 divisors (see below), whose sum is σ = 19843114475520. Its totient is φ = 5213864678400.

The previous prime is 11050505005601. The next prime is 11050505005619. The reversal of 11050505005605 is 50650050505011.

It is not a de Polignac number, because 11050505005605 - 2² = 11050505005601 is a prime.

It is a super-2 number, since 2×11050505005605² (a number of 27 digits) contains 22 as substring.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11050505005601) by changing a digit.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1317571222 + ... + 1317579608.

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

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

11050505005605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 10131.

The product of its (nonzero) digits is 18750, while the sum is 33.

The spelling of 11050505005605 in words is "eleven trillion, fifty billion, five hundred five million, five thousand, six hundred five".