Search a number
-
+
107670636817 is a prime number
BaseRepresentation
bin110010001000110101…
…0111000100100010001
3101021220202022001210121
41210101222320210101
53231002140334232
6121244015230241
710531115212102
oct1442152704421
9337822261717
10107670636817
11417322a4077
1218a4a818381
13a1cba438b3
1452d5ab03a9
152c02875d97
hex1911ab8911

107670636817 has 2 divisors, whose sum is σ = 107670636818. Its totient is φ = 107670636816.

The previous prime is 107670636781. The next prime is 107670636869. The reversal of 107670636817 is 718636076701.

Together with previous prime (107670636781) it forms an Ormiston pair, because they use the same digits, order apart.

It is an a-pointer prime, because the next prime (107670636869) can be obtained adding 107670636817 to its sum of digits (52).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 72252902401 + 35417734416 = 268799^2 + 188196^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 2107670636817 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1778112, while the sum is 52.

The spelling of 107670636817 in words is "one hundred seven billion, six hundred seventy million, six hundred thirty-six thousand, eight hundred seventeen".