Search a number
-
+
107662973909801 is a prime number
BaseRepresentation
bin11000011110101100111101…
…010100001011101100101001
3112010012110221202122122012212
4120132230331110023230221
5103102422232310103201
61020551404252014505
731451251600515242
oct3036547524135451
9463173852578185
10107662973909801
113133967a005572
12100a9980161435
13480c762006c9b
141c82cb6b15cc9
15c6a8636ccabb
hex61eb3d50bb29

107662973909801 has 2 divisors, whose sum is σ = 107662973909802. Its totient is φ = 107662973909800.

The previous prime is 107662973909747. The next prime is 107662973909809. The reversal of 107662973909801 is 108909379266701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65689420219801 + 41973553690000 = 8104901^2 + 6478700^2 .

It is a cyclic number.

It is not a de Polignac number, because 107662973909801 - 238 = 107388096002857 is a prime.

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

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

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

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

Almost surely, 2107662973909801 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 61725888, while the sum is 68.

The spelling of 107662973909801 in words is "one hundred seven trillion, six hundred sixty-two billion, nine hundred seventy-three million, nine hundred nine thousand, eight hundred one".