Search a number
-
+
107370507513497 is a prime number
BaseRepresentation
bin11000011010011100100100…
…111101011010111010011001
3112002011112001021112022220212
4120122130210331122322121
5103033124244410412442
61020205155154100505
731421156161254014
oct3032344475327231
9462145037468825
10107370507513497
1131236638391228
121006115987a735
1347bacc2c00757
141c72a9035237b
15c62e475dca82
hex61a724f5ae99

107370507513497 has 2 divisors, whose sum is σ = 107370507513498. Its totient is φ = 107370507513496.

The previous prime is 107370507513491. The next prime is 107370507513613. The reversal of 107370507513497 is 794315705073701.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 76755488962441 + 30615018551056 = 8761021^2 + 5533084^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-107370507513497 is a prime.

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

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

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

Almost surely, 2107370507513497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19448100, while the sum is 59.

The spelling of 107370507513497 in words is "one hundred seven trillion, three hundred seventy billion, five hundred seven million, five hundred thirteen thousand, four hundred ninety-seven".