Search a number
-
+
65695259657 is a prime number
BaseRepresentation
bin111101001011101111…
…100001110000001001
320021120102012222021002
4331023233201300021
52034020441302112
650102513224345
74513663331156
oct751357416011
9207512188232
1065695259657
1125952296a25
12108952620b5
13626c658611
14327301722d
151a977421c2
hexf4bbe1c09

65695259657 has 2 divisors, whose sum is σ = 65695259658. Its totient is φ = 65695259656.

The previous prime is 65695259611. The next prime is 65695259659. The reversal of 65695259657 is 75695259656.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 55531393801 + 10163865856 = 235651^2 + 100816^2 .

It is a cyclic number.

It is not a de Polignac number, because 65695259657 - 26 = 65695259593 is a prime.

Together with 65695259659, 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 = 65695259593 and 65695259602.

It is not a weakly prime, because it can be changed into another prime (65695259659) 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, 32847629828 + 32847629829.

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

Almost surely, 265695259657 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 153090000, while the sum is 65.

Subtracting 65695259657 from its reverse (75695259656), we obtain a palindrome (9999999999).

The spelling of 65695259657 in words is "sixty-five billion, six hundred ninety-five million, two hundred fifty-nine thousand, six hundred fifty-seven".