11506695569 has 2 divisors, whose sum is σ = 11506695570. Its totient is φ = 11506695568.

The previous prime is 11506695559. The next prime is 11506695589. The reversal of 11506695569 is 96559660511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11469339025 + 37356544 = 107095^2 + 6112^2 .

It is a cyclic number.

It is not a de Polignac number, because 11506695569 - 2¹² = 11506691473 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 11506695569.

It is not a weakly prime, because it can be changed into another prime (11506695559) 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 as a sum of consecutive naturals, namely, 5753347784 + 5753347785.

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

Almost surely, 2^11506695569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2187000, while the sum is 53.

The spelling of 11506695569 in words is "eleven billion, five hundred six million, six hundred ninety-five thousand, five hundred sixty-nine".