Search a number
-
+
504351112469 is a prime number
BaseRepresentation
bin1110101011011011010…
…10110011110100010101
31210012211002121010110012
413111231222303310111
531230402341044334
61023410134410005
751303201502421
oct7255552636425
91705732533405
10504351112469
11184992066716
12818b6200905
1338738724b39
141a5a7053b81
15d1bcb119ce
hex756dab3d15

504351112469 has 2 divisors, whose sum is σ = 504351112470. Its totient is φ = 504351112468.

The previous prime is 504351112399. The next prime is 504351112501. The reversal of 504351112469 is 964211153405.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 463420562500 + 40930549969 = 680750^2 + 202313^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2504351112469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 129600, while the sum is 41.

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