Search a number
-
+
11591557288561 is a prime number
BaseRepresentation
bin1010100010101101111010…
…1001111001001001110001
31112001010211120001112222101
42220223132221321021301
53004404002131213221
640353030553140401
72304314411156305
oct250533651711161
945033746045871
1011591557288561
113769a51997438
1213726310ba701
13661104bc4103
142c106a42dd05
151517ca22cd91
hexa8adea79271

11591557288561 has 2 divisors, whose sum is σ = 11591557288562. Its totient is φ = 11591557288560.

The previous prime is 11591557288543. The next prime is 11591557288613. The reversal of 11591557288561 is 16588275519511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5943995156961 + 5647562131600 = 2438031^2 + 2376460^2 .

It is a cyclic number.

It is not a de Polignac number, because 11591557288561 - 25 = 11591557288529 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11591557288493 and 11591557288502.

It is not a weakly prime, because it can be changed into another prime (11591557288501) 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, 5795778644280 + 5795778644281.

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

Almost surely, 211591557288561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 30240000, while the sum is 64.

The spelling of 11591557288561 in words is "eleven trillion, five hundred ninety-one billion, five hundred fifty-seven million, two hundred eighty-eight thousand, five hundred sixty-one".