Search a number
-
+
111700214152697 is a prime number
BaseRepresentation
bin11001011001011100111011…
…100101011111110111111001
3112122111102202222102200121102
4121121130323211133313321
5104120044014310341242
61033322211525421145
732346034302413162
oct3131347345376771
9478442688380542
10111700214152697
1132655881963885
12106402bb86a7b5
134a433921a7cb1
141d82467cb6769
15cda8a3c33e32
hex65973b95fdf9

111700214152697 has 2 divisors, whose sum is σ = 111700214152698. Its totient is φ = 111700214152696.

The previous prime is 111700214152669. The next prime is 111700214152711. The reversal of 111700214152697 is 796251412007111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92685983550736 + 19014230601961 = 9627356^2 + 4360531^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2111700214152697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 211680, while the sum is 47.

The spelling of 111700214152697 in words is "one hundred eleven trillion, seven hundred billion, two hundred fourteen million, one hundred fifty-two thousand, six hundred ninety-seven".