Search a number
-
+
515115397 is a prime number
BaseRepresentation
bin11110101101000…
…000100110000101
31022220021120111001
4132231000212011
52023332143042
6123040413301
715523260106
oct3655004605
91286246431
10515115397
11244850905
12124617231
1382948114
144c5ac3ad
1530351bb7
hex1eb40985

515115397 has 2 divisors, whose sum is σ = 515115398. Its totient is φ = 515115396.

The previous prime is 515115373. The next prime is 515115401. The reversal of 515115397 is 793511515.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 423989281 + 91126116 = 20591^2 + 9546^2 .

It is a cyclic number.

It is not a de Polignac number, because 515115397 - 27 = 515115269 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2515115397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 23625, while the sum is 37.

The square root of 515115397 is about 22696.1537930990. The cubic root of 515115397 is about 801.6193226354.

The spelling of 515115397 in words is "five hundred fifteen million, one hundred fifteen thousand, three hundred ninety-seven".