Search a number
-
+
512465561609 is a prime number
BaseRepresentation
bin1110111010100010101…
…00111110100000001001
31210222202121100212001112
413131101110332200021
531344012140432414
61031231243300105
752011242254511
oct7352124764011
91728677325045
10512465561609
111883764a4431
128339b81a635
133942c89a431
141ab369d0841
15d4e51b7d3e
hex775153e809

512465561609 has 2 divisors, whose sum is σ = 512465561610. Its totient is φ = 512465561608.

The previous prime is 512465561603. The next prime is 512465561611. The reversal of 512465561609 is 906165564215.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 512398272400 + 67289209 = 715820^2 + 8203^2 .

It is a cyclic number.

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

Together with 512465561611, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2512465561609 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 512465561609 in words is "five hundred twelve billion, four hundred sixty-five million, five hundred sixty-one thousand, six hundred nine".