Search a number
-
+
5300610569 is a prime number
BaseRepresentation
bin1001110111111000…
…01110011000001001
3111200102000220201222
410323330032120021
541323424014234
62233550251425
7245232306062
oct47374163011
914612026658
105300610569
1122800691a1
12103b1b6b75
13666211577
14383d93569
1521053642e
hex13bf0e609

5300610569 has 2 divisors, whose sum is σ = 5300610570. Its totient is φ = 5300610568.

The previous prime is 5300610551. The next prime is 5300610599. The reversal of 5300610569 is 9650160035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4532655625 + 767954944 = 67325^2 + 27712^2 .

It is a cyclic number.

It is not a de Polignac number, because 5300610569 - 28 = 5300610313 is a prime.

It is a super-2 number, since 2×53006105692 = 56192944808389007522, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 25300610569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24300, while the sum is 35.

The square root of 5300610569 is about 72805.2921771488. The cubic root of 5300610569 is about 1743.5803505958.

The spelling of 5300610569 in words is "five billion, three hundred million, six hundred ten thousand, five hundred sixty-nine".