Search a number
-
+
107766968069 is a prime number
BaseRepresentation
bin110010001011101101…
…0010110111100000101
3101022011110120012102202
41210113122112330011
53231201320434234
6121301340044245
710533365054165
oct1442732267405
9338143505382
10107766968069
114178170a182
1218a76b33685
13a2159a1537
1453047c85a5
152c0b05377e
hex1917696f05

107766968069 has 2 divisors, whose sum is σ = 107766968070. Its totient is φ = 107766968068.

The previous prime is 107766967999. The next prime is 107766968081. The reversal of 107766968069 is 960869667701.

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., 64320568225 + 43446399844 = 253615^2 + 208438^2 .

It is a cyclic number.

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

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2107766968069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 41150592, while the sum is 65.

The spelling of 107766968069 in words is "one hundred seven billion, seven hundred sixty-six million, nine hundred sixty-eight thousand, sixty-nine".