Search a number
-
+
65889559313 is a prime number
BaseRepresentation
bin111101010111010100…
…101110001100010001
320022001221211102021122
4331113110232030101
52034420211344223
650134053532025
74521543004364
oct752724561421
9208057742248
1065889559313
1125a41a36156
121092a344015
1362a0998126
143290b540db
151aa98225c8
hexf5752e311

65889559313 has 2 divisors, whose sum is σ = 65889559314. Its totient is φ = 65889559312.

The previous prime is 65889559297. The next prime is 65889559331. The reversal of 65889559313 is 31395598856.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 56628769024 + 9260790289 = 237968^2 + 96233^2 .

It is a cyclic number.

It is not a de Polignac number, because 65889559313 - 24 = 65889559297 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 265889559313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 34992000, while the sum is 62.

The spelling of 65889559313 in words is "sixty-five billion, eight hundred eighty-nine million, five hundred fifty-nine thousand, three hundred thirteen".