1057561567 has 4 divisors (see below), whose sum is σ = 1073346136. Its totient is φ = 1041777000.

The previous prime is 1057561553. The next prime is 1057561573. The reversal of 1057561567 is 7651657501.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7651657501 = 367 ⋅20849203.

It is a cyclic number.

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

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1057562567) 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 3 ways as a sum of consecutive naturals, for example, 7892184 + ... + 7892317.

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

Almost surely, 2^1057561567 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15784568.

The product of its (nonzero) digits is 220500, while the sum is 43.

The square root of 1057561567 is about 32520.1716938887. The cubic root of 1057561567 is about 1018.8303801383.

The spelling of 1057561567 in words is "one billion, fifty-seven million, five hundred sixty-one thousand, five hundred sixty-seven".