Search a number
-
+
11011077370751 is a prime number
BaseRepresentation
bin1010000000111011011101…
…0110101111001101111111
31102222122111220200102021012
42200032313112233031333
52420401141301331001
635230230310025435
72214344522242013
oct240166726571577
942878456612235
1011011077370751
113565854132577
12129a02b64827b
1361b45639b0c3
142a0d20826543
15141653e2d2bb
hexa03b75af37f

11011077370751 has 2 divisors, whose sum is σ = 11011077370752. Its totient is φ = 11011077370750.

The previous prime is 11011077370739. The next prime is 11011077370753. The reversal of 11011077370751 is 15707377011011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11011077370751 - 26 = 11011077370687 is a prime.

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

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 211011077370751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36015, while the sum is 41.

The spelling of 11011077370751 in words is "eleven trillion, eleven billion, seventy-seven million, three hundred seventy thousand, seven hundred fifty-one".