Search a number
-
+
1310537527151 is a prime number
BaseRepresentation
bin10011000100100010000…
…111111010111101101111
311122021201121120021222112
4103010202013322331233
5132432440101332101
62442015211234235
7163453225116026
oct23044207727557
94567647507875
101310537527151
114658832a5316
12191ba844897b
1396777278ac8
1447604c718bd
15241540b06bb
hex131221faf6f

1310537527151 has 2 divisors, whose sum is σ = 1310537527152. Its totient is φ = 1310537527150.

The previous prime is 1310537527147. The next prime is 1310537527153. The reversal of 1310537527151 is 1517257350131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1310537527151 - 22 = 1310537527147 is a prime.

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

Together with 1310537527153, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 1310537527099 and 1310537527108.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1310537527153) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655268763575 + 655268763576.

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

Almost surely, 21310537527151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 110250, while the sum is 41.

The spelling of 1310537527151 in words is "one trillion, three hundred ten billion, five hundred thirty-seven million, five hundred twenty-seven thousand, one hundred fifty-one".