Search a number
-
+
222220213307017 is a prime number
BaseRepresentation
bin110010100001101110101100…
…111000000100011010001001
31002010211001012202010111011021
4302201232230320010122021
5213111323444101311032
62104342320124032441
764543611021144652
oct6241565470043211
91063731182114137
10222220213307017
1164896077163082
1220b0b923992721
1396cc378a66c33
143cc3731182529
151aa56cebca097
hexca1bace04689

222220213307017 has 2 divisors, whose sum is σ = 222220213307018. Its totient is φ = 222220213307016.

The previous prime is 222220213306979. The next prime is 222220213307023. The reversal of 222220213307017 is 710703312022222.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 196520697365056 + 25699515941961 = 14018584^2 + 5069469^2 .

It is a cyclic number.

It is not a de Polignac number, because 222220213307017 - 239 = 221670457493129 is a prime.

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

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

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

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

Almost surely, 2222220213307017 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28224, while the sum is 34.

Adding to 222220213307017 its reverse (710703312022222), we get a palindrome (932923525329239).

The spelling of 222220213307017 in words is "two hundred twenty-two trillion, two hundred twenty billion, two hundred thirteen million, three hundred seven thousand, seventeen".