Search a number
-
+
11071771567561 is a prime number
BaseRepresentation
bin1010000100011101100100…
…0000101110010111001001
31110012110011210112002000101
42201013121000232113021
52422344442010130221
635314145053205401
72221623551351065
oct241073100562711
943173153462011
1011071771567561
11358956a455a01
1212a9949a90861
136240a98b5123
142a3c3b582aa5
151430075a8d91
hexa11d902e5c9

11071771567561 has 2 divisors, whose sum is σ = 11071771567562. Its totient is φ = 11071771567560.

The previous prime is 11071771567559. The next prime is 11071771567589. The reversal of 11071771567561 is 16576517717011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10387438932025 + 684332635536 = 3222955^2 + 827244^2 .

It is a cyclic number.

It is not a de Polignac number, because 11071771567561 - 21 = 11071771567559 is a prime.

Together with 11071771567559, it forms a pair of twin primes.

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

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

Almost surely, 211071771567561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2160900, while the sum is 55.

The spelling of 11071771567561 in words is "eleven trillion, seventy-one billion, seven hundred seventy-one million, five hundred sixty-seven thousand, five hundred sixty-one".