Search a number
-
+
107136811143347 is a prime number
BaseRepresentation
bin11000010111000010111011…
…100100100001000010110011
3112001100011211120120200110012
4120113002323210201002303
5103020312142123041342
61015505545505525135
731365244025012546
oct3027027344410263
9461304746520405
10107136811143347
1131156514926437
12100239b93437ab
1347a1c5b796b1b
141c65640d4c85d
15c5bd1ac93b82
hex6170bb9210b3

107136811143347 has 2 divisors, whose sum is σ = 107136811143348. Its totient is φ = 107136811143346.

The previous prime is 107136811143331. The next prime is 107136811143353. The reversal of 107136811143347 is 743341118631701.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 107136811143347 - 24 = 107136811143331 is a prime.

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

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

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

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

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

Almost surely, 2107136811143347 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1016064, while the sum is 50.

The spelling of 107136811143347 in words is "one hundred seven trillion, one hundred thirty-six billion, eight hundred eleven million, one hundred forty-three thousand, three hundred forty-seven".