Search a number
-
+
1313606011537 is a prime number
BaseRepresentation
bin10011000111011001000…
…001010000101010010001
311122120122110110110020101
4103013121001100222101
5133010231114332122
62443243503412401
7163622244603451
oct23073101205221
94576573413211
101313606011537
11467108391026
12192703bb4101
1396b45bbb041
14478165c3d61
1524283681027
hex131d9050a91

1313606011537 has 2 divisors, whose sum is σ = 1313606011538. Its totient is φ = 1313606011536.

The previous prime is 1313606011517. The next prime is 1313606011561. The reversal of 1313606011537 is 7351106063131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 789474898576 + 524131112961 = 888524^2 + 723969^2 .

It is a cyclic number.

It is not a de Polignac number, because 1313606011537 - 231 = 1311458527889 is a prime.

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

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

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

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

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

Almost surely, 21313606011537 is an apocalyptic number.

It is an amenable number.

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

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

1313606011537 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 34020, while the sum is 37.

The spelling of 1313606011537 in words is "one trillion, three hundred thirteen billion, six hundred six million, eleven thousand, five hundred thirty-seven".