Search a number
-
+
110222102212141 is a prime number
BaseRepresentation
bin11001000011111100010101…
…001111111010111000101101
3112110021010111211001011210011
4121003330111033322320231
5103421334331131242031
61030231200145013221
732134166305260043
oct3103742517727055
9473233454034704
10110222102212141
1132135a2723a517
1210441947024211
134966b9067bc6a
141d30ac75ac393
15cb21e32556b1
hex643f153fae2d

110222102212141 has 2 divisors, whose sum is σ = 110222102212142. Its totient is φ = 110222102212140.

The previous prime is 110222102212081. The next prime is 110222102212147. The reversal of 110222102212141 is 141212201222011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110116249589641 + 105852622500 = 10493629^2 + 325350^2 .

It is a cyclic number.

It is not a de Polignac number, because 110222102212141 - 211 = 110222102210093 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110222102212141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 256, while the sum is 22.

Adding to 110222102212141 its reverse (141212201222011), we get a palindrome (251434303434152).

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