Search a number
-
+
505411323210509 is a prime number
BaseRepresentation
bin111001011101010110011111…
…0011000101010101100001101
32110021111211222002212211112112
41302322230332120222230031
51012221124342220214014
64550530431230113405
7211312522513343432
oct16272547630525415
92407454862784475
10505411323210509
111370488139a7341
124882812564b865
1318902110c57241
148cb4077b6bb89
153d66d95b4d73e
hex1cbab3e62ab0d

505411323210509 has 2 divisors, whose sum is σ = 505411323210510. Its totient is φ = 505411323210508.

The previous prime is 505411323210433. The next prime is 505411323210581. The reversal of 505411323210509 is 905012323114505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 491420357008009 + 13990966202500 = 22168003^2 + 3740450^2 .

It is a cyclic number.

It is not a de Polignac number, because 505411323210509 - 232 = 505407028243213 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2505411323210509 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 505411323210509 in words is "five hundred five trillion, four hundred eleven billion, three hundred twenty-three million, two hundred ten thousand, five hundred nine".