Search a number
-
+
1313524615369 is a prime number
BaseRepresentation
bin10011000111010100001…
…010110000100011001001
311122120102210022002200111
4103013110022300203021
5133010044300142434
62443231435034321
7163620236004031
oct23072412604311
94576383262614
101313524615369
1146707644696a
121926a089b9a1
1396b3208c325
14478098768c1
152427b453964
hex131d42b08c9

1313524615369 has 2 divisors, whose sum is σ = 1313524615370. Its totient is φ = 1313524615368.

The previous prime is 1313524615339. The next prime is 1313524615393. The reversal of 1313524615369 is 9635164253131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1141040558025 + 172484057344 = 1068195^2 + 415312^2 .

It is a cyclic number.

It is not a de Polignac number, because 1313524615369 - 213 = 1313524607177 is a prime.

It is a super-2 number, since 2×13135246153692 (a number of 25 digits) contains 22 as substring.

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

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

Almost surely, 21313524615369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1749600, while the sum is 49.

The spelling of 1313524615369 in words is "one trillion, three hundred thirteen billion, five hundred twenty-four million, six hundred fifteen thousand, three hundred sixty-nine".