Search a number
-
+
605060103013 is a prime number
BaseRepresentation
bin10001100111000000110…
…01000111101101100101
32010211202200022220212221
420303200121013231211
534403130341244023
61141543305512341
761466645005642
oct10634031075545
92124680286787
10605060103013
11213671721913
12993214a26b1
13450980a0bc2
14213dc30cdc9
1510b141e785d
hex8ce0647b65

605060103013 has 2 divisors, whose sum is σ = 605060103014. Its totient is φ = 605060103012.

The previous prime is 605060102993. The next prime is 605060103017. The reversal of 605060103013 is 310301060506.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 497445268804 + 107614834209 = 705298^2 + 328047^2 .

It is a cyclic number.

It is not a de Polignac number, because 605060103013 - 29 = 605060102501 is a prime.

It is a super-3 number, since 3×6050601030133 (a number of 36 digits) contains 333 as substring.

It is a congruent number.

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

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

Almost surely, 2605060103013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1620, while the sum is 25.

Adding to 605060103013 its reverse (310301060506), we get a palindrome (915361163519).

The spelling of 605060103013 in words is "six hundred five billion, sixty million, one hundred three thousand, thirteen".