Search a number
-
+
11013665256637 is a prime number
BaseRepresentation
bin1010000001000101000110…
…0110101111010010111101
31102222220012021020122022121
42200101101212233102331
52420421441301203022
635231335153242541
72214465615016561
oct240212146572275
942886167218277
1011013665256637
113566961a0353a
12129a632263451
1361b77958c124
142a10c83d36a1
151417562192c7
hexa04519af4bd

11013665256637 has 2 divisors, whose sum is σ = 11013665256638. Its totient is φ = 11013665256636.

The previous prime is 11013665256623. The next prime is 11013665256697. The reversal of 11013665256637 is 73665256631011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9916490710116 + 1097174546521 = 3149046^2 + 1047461^2 .

It is an emirp because it is prime and its reverse (73665256631011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11013665256637 - 27 = 11013665256509 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211013665256637 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11013665256637 in words is "eleven trillion, thirteen billion, six hundred sixty-five million, two hundred fifty-six thousand, six hundred thirty-seven".