11050505550061 has 32 divisors (see below), whose sum is σ = 11531629605888. Its totient is φ = 10582107079680.

The previous prime is 11050505550041. The next prime is 11050505550121. The reversal of 11050505550061 is 16005550505011.

It is a cyclic number.

It is not a de Polignac number, because 11050505550061 - 2⁷ = 11050505549933 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11050505550041) 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, 761938936 + ... + 761953438.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 16381.

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

The spelling of 11050505550061 in words is "eleven trillion, fifty billion, five hundred five million, five hundred fifty thousand, sixty-one".