Search a number
-
+
11061463365781 is a prime number
BaseRepresentation
bin1010000011110111001010…
…0110000011100010010101
31110011110120101211011112021
42200331302212003202111
52422212334110201111
635305322140453141
72221110242156503
oct240756246034225
943143511734467
1011061463365781
11358515a775384
1212a795184a1b1
136231260b794a
142a3540513673
15142b0261bd71
hexa0f72983895

11061463365781 has 2 divisors, whose sum is σ = 11061463365782. Its totient is φ = 11061463365780.

The previous prime is 11061463365731. The next prime is 11061463365817. The reversal of 11061463365781 is 18756336416011.

Together with next prime (11061463365817) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9910061400625 + 1151401965156 = 3148025^2 + 1073034^2 .

It is a cyclic number.

It is not a de Polignac number, because 11061463365781 - 219 = 11061462841493 is a prime.

It is a super-2 number, since 2×110614633657812 (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 (11061463365731) by changing a digit.

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

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

Almost surely, 211061463365781 is an apocalyptic number.

It is an amenable number.

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

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

11061463365781 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2177280, while the sum is 52.

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