656065151591 has 2 divisors, whose sum is σ = 656065151592. Its totient is φ = 656065151590.

The previous prime is 656065151519. The next prime is 656065151641. The reversal of 656065151591 is 195151560656.

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

It is an a-pointer prime, because the next prime (656065151641) can be obtained adding 656065151591 to its sum of digits (50).

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-656065151591 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2^656065151591 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1215000, while the sum is 50.

The spelling of 656065151591 in words is "six hundred fifty-six billion, sixty-five million, one hundred fifty-one thousand, five hundred ninety-one".