Search a number
-
+
111002122100071 is a prime number
BaseRepresentation
bin11001001111010010110010…
…000011101001110101100111
3112120000200212202002001122001
4121033102302003221311213
5104022124321224200241
61032025400530150131
732244432031026346
oct3117226203516547
9476020782061561
10111002122100071
11324068101192a4
1210548b56122347
1349c25bc0c50c7
141d5a762147b5d
15cc7647409431
hex64f4b20e9d67

111002122100071 has 2 divisors, whose sum is σ = 111002122100072. Its totient is φ = 111002122100070.

The previous prime is 111002122100017. The next prime is 111002122100083. The reversal of 111002122100071 is 170001221200111.

Together with previous prime (111002122100017) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111002122100071 - 231 = 110999974616423 is a prime.

It is a super-2 number, since 2×1110021221000712 (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 (111002122200071) by changing a digit.

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

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

Almost surely, 2111002122100071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 56, while the sum is 19.

Adding to 111002122100071 its reverse (170001221200111), we get a palindrome (281003343300182).

The spelling of 111002122100071 in words is "one hundred eleven trillion, two billion, one hundred twenty-two million, one hundred thousand, seventy-one".