1056515161 has 12 divisors (see below), whose sum is σ = 1161124752. Its totient is φ = 960678576.

The previous prime is 1056515147. The next prime is 1056515219. The reversal of 1056515161 is 1615156501.

It is not a de Polignac number, because 1056515161 - 2⁵ = 1056515129 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2^1056515161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

The square root of 1056515161 is about 32504.0791440090. The cubic root of 1056515161 is about 1018.4942414613.

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