Search a number
-
+
1310910913813 is a prime number
BaseRepresentation
bin10011000100111000011…
…000010001110100010101
311122022200122011022012011
4103010320120101310111
5132434221143220223
62442120230224221
7163465410625624
oct23047030216425
94568618138164
101310910913813
11465a55043236
121920914b5071
139680672ca67
144763c6a96bb
1524176c6880d
hex13138611d15

1310910913813 has 2 divisors, whose sum is σ = 1310910913814. Its totient is φ = 1310910913812.

The previous prime is 1310910913783. The next prime is 1310910913831. The reversal of 1310910913813 is 3183190190131.

Together with next prime (1310910913831) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 852929825764 + 457981088049 = 923542^2 + 676743^2 .

It is a cyclic number.

It is not a de Polignac number, because 1310910913813 - 225 = 1310877359381 is a prime.

It is a congruent number.

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

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

Almost surely, 21310910913813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 40.

The spelling of 1310910913813 in words is "one trillion, three hundred ten billion, nine hundred ten million, nine hundred thirteen thousand, eight hundred thirteen".