1067715141561 has 64 divisors (see below), whose sum is σ = 1725287558400. Its totient is φ = 649945497600.

The previous prime is 1067715141487. The next prime is 1067715141599. The reversal of 1067715141561 is 1651415177601.

1067715141561 is a `hidden beast` number, since 1 + 0 + 6 + 7 + 71 + 5 + 14 + 1 + 561 = 666.

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

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

It is a Curzon number.

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

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

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

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 176400, while the sum is 45.

The spelling of 1067715141561 in words is "one trillion, sixty-seven billion, seven hundred fifteen million, one hundred forty-one thousand, five hundred sixty-one".