Search a number
-
+
11651083664677 is a prime number
BaseRepresentation
bin1010100110001011101010…
…1100111111110100100101
31112020211111001102202220021
42221202322230333310211
53011342404404232202
640440233422035141
72311522500053332
oct251427254776445
945224431382807
1011651083664677
113792218a928a6
121382084418ab1
136669004a2882
142c3cb6035989
151531110c7a37
hexa98bab3fd25

11651083664677 has 2 divisors, whose sum is σ = 11651083664678. Its totient is φ = 11651083664676.

The previous prime is 11651083664567. The next prime is 11651083664719. The reversal of 11651083664677 is 77646638015611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10048811240196 + 1602272424481 = 3169986^2 + 1265809^2 .

It is a cyclic number.

It is not a de Polignac number, because 11651083664677 - 235 = 11616723926309 is a prime.

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

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

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

Almost surely, 211651083664677 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11651083664677 in words is "eleven trillion, six hundred fifty-one billion, eighty-three million, six hundred sixty-four thousand, six hundred seventy-seven".