10561566051 has 32 divisors (see below), whose sum is σ = 15977286720. Its totient is φ = 6893724672.

The previous prime is 10561566019. The next prime is 10561566079. The reversal of 10561566051 is 15066516501.

10561566051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10561566051 - 2⁵ = 10561566019 is a prime.

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

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

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 250471 + ... + 289583.

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

Almost surely, 2^10561566051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 39332 (or 39326 counting only the distinct ones).

The product of its (nonzero) digits is 27000, while the sum is 36.

It can be divided in two parts, 105 and 61566051, that added together give a triangular number (61566156 = T₁₁₀₉₆).

The spelling of 10561566051 in words is "ten billion, five hundred sixty-one million, five hundred sixty-six thousand, fifty-one".