10561131 has 64 divisors (see below), whose sum is σ = 20044800. Its totient is φ = 5349888.

The previous prime is 10561127. The next prime is 10561139. The reversal of 10561131 is 13116501.

It is not a de Polignac number, because 10561131 - 2² = 10561127 is a prime.

It is a super-2 number, since 2×10561131² = 223074975998322, which contains 22 as substring.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 60961 + ... + 61133.

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

Almost surely, 2^10561131 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 90, while the sum is 18.

The square root of 10561131 is about 3249.7893777905. The cubic root of 10561131 is about 219.4000942877.

Adding to 10561131 its reverse (13116501), we get a palindrome (23677632).

It can be divided in two parts, 1056 and 1131, that added together give a 7-th power (2187 = 3⁷).

The spelling of 10561131 in words is "ten million, five hundred sixty-one thousand, one hundred thirty-one".