1056050561111 has 8 divisors (see below), whose sum is σ = 1299754536864. Its totient is φ = 835556487840.

The previous prime is 1056050561077. The next prime is 1056050561117. The reversal of 1056050561111 is 1111650506501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1056050561111 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5802475520 + ... + 5802475701.

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

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

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

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

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

The sum of its prime factors is 11604951241.

The product of its (nonzero) digits is 4500, while the sum is 32.

It can be divided in two parts, 1056050 and 561111, that added together give a palindrome (1617161).

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