Search a number
-
+
107370507513613 is a prime number
BaseRepresentation
bin11000011010011100100100…
…111101011010111100001101
3112002011112001021112100002011
4120122130210331122330031
5103033124244410413423
61020205155154101221
731421156161254241
oct3032344475327415
9462145037470064
10107370507513613
1131236638391323
121006115987a811
1347bacc2c00816
141c72a90352421
15c62e475dcb0d
hex61a724f5af0d

107370507513613 has 2 divisors, whose sum is σ = 107370507513614. Its totient is φ = 107370507513612.

The previous prime is 107370507513497. The next prime is 107370507513629. The reversal of 107370507513613 is 316315705073701.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104128411974889 + 3242095538724 = 10204333^2 + 1800582^2 .

It is a cyclic number.

It is not a de Polignac number, because 107370507513613 - 213 = 107370507505421 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2107370507513613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1389150, while the sum is 49.

The spelling of 107370507513613 in words is "one hundred seven trillion, three hundred seventy billion, five hundred seven million, five hundred thirteen thousand, six hundred thirteen".