11056550056051 has 4 divisors (see below), whose sum is σ = 11056812120432. Its totient is φ = 11056287991672.

The previous prime is 11056550056049. The next prime is 11056550056109. The reversal of 11056550056051 is 15065005565011.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 11056550056051 - 2¹ = 11056550056049 is a prime.

It is a super-2 number, since 2×11056550056051² (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 = 11056550055995 and 11056550056013.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 130968895 + ... + 131053288.

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

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

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

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

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

The sum of its prime factors is 262064380.

The product of its (nonzero) digits is 112500, while the sum is 40.

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