69515130397 has 2 divisors, whose sum is σ = 69515130398. Its totient is φ = 69515130396.

The previous prime is 69515130341. The next prime is 69515130449. The reversal of 69515130397 is 79303151596.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 46457922681 + 23057207716 = 215541^2 + 151846^2 .

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 69515130397.

It is a congruent number.

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

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

Almost surely, 2^69515130397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 765450, while the sum is 49.

The spelling of 69515130397 in words is "sixty-nine billion, five hundred fifteen million, one hundred thirty thousand, three hundred ninety-seven".