11501063505469 has 2 divisors, whose sum is σ = 11501063505470. Its totient is φ = 11501063505468.

The previous prime is 11501063505383. The next prime is 11501063505509. The reversal of 11501063505469 is 96450536010511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11103470202969 + 397593302500 = 3332187^2 + 630550^2 .

It is an emirp because it is prime and its reverse (96450536010511) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11501063505469 - 2¹³ = 11501063497277 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11501063505769) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5750531752734 + 5750531752735.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486000, while the sum is 46.

The spelling of 11501063505469 in words is "eleven trillion, five hundred one billion, sixty-three million, five hundred five thousand, four hundred sixty-nine".