Search a number
-
+
5302425405113 is a prime number
BaseRepresentation
bin100110100101001000100…
…1011101100011010111001
3200202220111010212111111022
41031022101023230122321
51143333331400430423
615135522310312225
71055042021201444
oct115122113543271
920686433774438
105302425405113
1117648229a85a1
1271778b658675
132c602a535215
141448d2a7c65b
1592ddccc3dc8
hex4d2912ec6b9

5302425405113 has 2 divisors, whose sum is σ = 5302425405114. Its totient is φ = 5302425405112.

The previous prime is 5302425405103. The next prime is 5302425405139. The reversal of 5302425405113 is 3115045242035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5227684406569 + 74740998544 = 2286413^2 + 273388^2 .

It is a cyclic number.

It is not a de Polignac number, because 5302425405113 - 24 = 5302425405097 is a prime.

It is a super-3 number, since 3×53024254051133 (a number of 39 digits) contains 333 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 (5302425405103) by changing a digit.

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

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

Almost surely, 25302425405113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 5302425405113 in words is "five trillion, three hundred two billion, four hundred twenty-five million, four hundred five thousand, one hundred thirteen".