Search a number
-
+
7111500110669 is a prime number
BaseRepresentation
bin110011101111100011001…
…1100000001101101001101
3221011212000200002110201202
41213133012130001231031
51413003323012020134
623042551131515245
71332534413366153
oct147370634015515
927155020073652
107111500110669
1122a1a74463839
1296a30abb8b25
133c77c4855c86
141a82ac74b3d3
15c4ebe363d7e
hex677c6701b4d

7111500110669 has 2 divisors, whose sum is σ = 7111500110670. Its totient is φ = 7111500110668.

The previous prime is 7111500110639. The next prime is 7111500110681. The reversal of 7111500110669 is 9660110051117.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6956606701444 + 154893409225 = 2637538^2 + 393565^2 .

It is a cyclic number.

It is not a de Polignac number, because 7111500110669 - 212 = 7111500106573 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 27111500110669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11340, while the sum is 38.

The spelling of 7111500110669 in words is "seven trillion, one hundred eleven billion, five hundred million, one hundred ten thousand, six hundred sixty-nine".