Search a number
-
+
505223406637 is a prime number
BaseRepresentation
bin1110101101000011010…
…10010110010000101101
31210022001212222021002121
413112201222112100231
531234144143003022
61024032454552541
751333623046205
oct7264152262055
91708055867077
10505223406637
1118529a495194
1281aba368751
133884736a831
141a64ac3b405
15d21e4b92c7
hex75a1a9642d

505223406637 has 2 divisors, whose sum is σ = 505223406638. Its totient is φ = 505223406636.

The previous prime is 505223406593. The next prime is 505223406641. The reversal of 505223406637 is 736604322505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 483885793161 + 21337613476 = 695619^2 + 146074^2 .

It is a cyclic number.

It is not a de Polignac number, because 505223406637 - 219 = 505222882349 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2505223406637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 907200, while the sum is 43.

The spelling of 505223406637 in words is "five hundred five billion, two hundred twenty-three million, four hundred six thousand, six hundred thirty-seven".