Search a number
-
+
511404631429 is a prime number
BaseRepresentation
bin1110111000100100001…
…01110110010110000101
31210220000200001000110011
413130102011312112011
531334324041201204
61030534104030221
751643040433556
oct7342205662605
91726020030404
10511404631429
1118798164492a
1283144462371
13392c0b48ab3
141aa75b4232d
15d481e9d304
hex7712176585

511404631429 has 2 divisors, whose sum is σ = 511404631430. Its totient is φ = 511404631428.

The previous prime is 511404631421. The next prime is 511404631487. The reversal of 511404631429 is 924136404115.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 427421750625 + 83982880804 = 653775^2 + 289798^2 .

It is a cyclic number.

It is not a de Polignac number, because 511404631429 - 23 = 511404631421 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 511404631391 and 511404631400.

It is a congruent number.

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

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

Almost surely, 2511404631429 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 40.

The spelling of 511404631429 in words is "five hundred eleven billion, four hundred four million, six hundred thirty-one thousand, four hundred twenty-nine".