Search a number
-
+
11095408926781 is a prime number
BaseRepresentation
bin1010000101110101100111…
…1010000110000000111101
31110021201012010101100002021
42201131121322012000331
52423241344141124111
635333054400000141
72223421401525604
oct241353172060075
943251163340067
1011095408926781
11359859a09a823
1212b2446000051
136263a5a2070a
142a5040980a3b
1514393c815d71
hexa1759e8603d

11095408926781 has 2 divisors, whose sum is σ = 11095408926782. Its totient is φ = 11095408926780.

The previous prime is 11095408926737. The next prime is 11095408926793. The reversal of 11095408926781 is 18762980459011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5791097860900 + 5304311065881 = 2406470^2 + 2303109^2 .

It is a cyclic number.

It is not a de Polignac number, because 11095408926781 - 227 = 11095274709053 is a prime.

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

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

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

Almost surely, 211095408926781 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8709120, while the sum is 61.

The spelling of 11095408926781 in words is "eleven trillion, ninety-five billion, four hundred eight million, nine hundred twenty-six thousand, seven hundred eighty-one".