Search a number
-
+
112210222002077 is a prime number
BaseRepresentation
bin11001100000110111111010…
…011011000010111110011101
3112201022012012022011211022002
4121200313322123002332131
5104201423013313031302
61034352355255532045
732430630622536143
oct3140677233027635
9481265168154262
10112210222002077
11328320a7007681
121070311438a025
134a7c4bc830c24
141d9d00a303593
15ce8ca3275c02
hex660dfa6c2f9d

112210222002077 has 2 divisors, whose sum is σ = 112210222002078. Its totient is φ = 112210222002076.

The previous prime is 112210222002017. The next prime is 112210222002107. The reversal of 112210222002077 is 770200222012211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84720868907236 + 27489353094841 = 9204394^2 + 5243029^2 .

It is a cyclic number.

It is not a de Polignac number, because 112210222002077 - 212 = 112210221997981 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2112210222002077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3136, while the sum is 29.

Adding to 112210222002077 its reverse (770200222012211), we get a palindrome (882410444014288).

The spelling of 112210222002077 in words is "one hundred twelve trillion, two hundred ten billion, two hundred twenty-two million, two thousand, seventy-seven".