Search a number
-
+
500550560501 is a prime number
BaseRepresentation
bin1110100100010110010…
…00110110101011110101
31202212000020012002021012
413102023020312223311
531200111420414001
61021541051402005
751110052364115
oct7221310665365
91685006162235
10500550560501
11183311818782
1281015453305
1338281226414
141a3263bb045
15d0491372bb
hex748b236af5

500550560501 has 2 divisors, whose sum is σ = 500550560502. Its totient is φ = 500550560500.

The previous prime is 500550560483. The next prime is 500550560509. The reversal of 500550560501 is 105065055005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 425240931025 + 75309629476 = 652105^2 + 274426^2 .

It is a cyclic number.

It is not a de Polignac number, because 500550560501 - 230 = 499476818677 is a prime.

It is a super-2 number, since 2×5005505605012 (a number of 24 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 (500550560509) by changing a digit.

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

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

Almost surely, 2500550560501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18750, while the sum is 32.

The spelling of 500550560501 in words is "five hundred billion, five hundred fifty million, five hundred sixty thousand, five hundred one".