Search a number
-
+
5000601509 is a prime number
BaseRepresentation
bin1001010100000111…
…10001111110100101
3110220111111212200022
410222003301332211
540220123222014
62144112124525
7234630261101
oct45203617645
913814455608
105000601509
112136788a22
12b76836745
1361900c607
143561ba901
151e4024a8e
hex12a0f1fa5

5000601509 has 2 divisors, whose sum is σ = 5000601510. Its totient is φ = 5000601508.

The previous prime is 5000601491. The next prime is 5000601523. The reversal of 5000601509 is 9051060005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4931129284 + 69472225 = 70222^2 + 8335^2 .

It is a cyclic number.

It is not a de Polignac number, because 5000601509 - 28 = 5000601253 is a prime.

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 (5000601559) by changing a digit.

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

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

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

Almost surely, 25000601509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 26.

The square root of 5000601509 is about 70714.9313016707. The cubic root of 5000601509 is about 1710.0445149886.

The spelling of 5000601509 in words is "five billion, six hundred one thousand, five hundred nine".