Search a number
-
+
1310571505013 is a prime number
BaseRepresentation
bin10011000100100100001…
…001100010010101110101
311122021210222111112211212
4103010210021202111311
5132433022301130023
62442022423411205
7163454116662611
oct23044411422565
94567728445755
101310571505013
114658a04a23a1
12191bb78b3b05
1396781314554
1447609598341
1524157072e78
hex13124262575

1310571505013 has 2 divisors, whose sum is σ = 1310571505014. Its totient is φ = 1310571505012.

The previous prime is 1310571504967. The next prime is 1310571505127. The reversal of 1310571505013 is 3105051750131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1282132729969 + 28438775044 = 1132313^2 + 168638^2 .

It is a cyclic number.

It is not a de Polignac number, because 1310571505013 - 28 = 1310571504757 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 (1310571505213) 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, 655285752506 + 655285752507.

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

Almost surely, 21310571505013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7875, while the sum is 32.

The spelling of 1310571505013 in words is "one trillion, three hundred ten billion, five hundred seventy-one million, five hundred five thousand, thirteen".