Search a number
-
+
505406311213 is a prime number
BaseRepresentation
bin1110101101011001001…
…00000100101100101101
31210022112122010210000011
413112230210010230231
531240033003424323
61024102551133221
751341303522536
oct7265444045455
91708478123004
10505406311213
111853837610a1
1281b4b674211
133887621a7ab
141a66724d68d
15d23059820d
hex75ac904b2d

505406311213 has 2 divisors, whose sum is σ = 505406311214. Its totient is φ = 505406311212.

The previous prime is 505406311177. The next prime is 505406311231. The reversal of 505406311213 is 312113604505.

Together with next prime (505406311231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 453416383044 + 51989928169 = 673362^2 + 228013^2 .

It is a cyclic number.

It is not a de Polignac number, because 505406311213 - 229 = 504869440301 is a prime.

It is a congruent number.

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

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

Almost surely, 2505406311213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 31.

Adding to 505406311213 its reverse (312113604505), we get a palindrome (817519915718).

The spelling of 505406311213 in words is "five hundred five billion, four hundred six million, three hundred eleven thousand, two hundred thirteen".