Search a number
-
+
1310991642713 is a prime number
BaseRepresentation
bin10011000100111101001…
…100001111000001011001
311122022220021001202102102
4103010331030033001121
5132434402330031323
62442132232413145
7163500411046064
oct23047514170131
94568807052372
101310991642713
11465a96672035
121920b45471b5
139681a386b3c
14476492c18db
152417ddb3328
hex1313d30f059

1310991642713 has 2 divisors, whose sum is σ = 1310991642714. Its totient is φ = 1310991642712.

The previous prime is 1310991642707. The next prime is 1310991642731. The reversal of 1310991642713 is 3172461990131.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1310720447689 + 271195024 = 1144867^2 + 16468^2 .

It is a cyclic number.

It is not a de Polignac number, because 1310991642713 - 222 = 1310987448409 is a prime.

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

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

Almost surely, 21310991642713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 244944, while the sum is 47.

The spelling of 1310991642713 in words is "one trillion, three hundred ten billion, nine hundred ninety-one million, six hundred forty-two thousand, seven hundred thirteen".