10561501156056 has 32 divisors (see below), whose sum is σ = 26403847296000. Its totient is φ = 3520487797920.

The previous prime is 10561501156021. The next prime is 10561501156057. The reversal of 10561501156056 is 65065110516501.

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

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

It is a congruent number.

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

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

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

It is an amenable number.

10561501156056 is an abundant number, since it is smaller than the sum of its proper divisors (15842346139944).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 135000, while the sum is 42.

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