Search a number
-
+
111010100011141 is a prime number
BaseRepresentation
bin11001001111011010001101…
…100100111110000010000101
3112120001110110201220221012211
4121033122031210332002011
5104022242141100324031
61032033200320343421
732245133523120322
oct3117321544760205
9476043421827184
10111010100011141
113240a134479a31
121054a601a74b71
1349c3290ba3046
141d5acbb901b49
15cc79629debb1
hex64f68d93e085

111010100011141 has 2 divisors, whose sum is σ = 111010100011142. Its totient is φ = 111010100011140.

The previous prime is 111010100011133. The next prime is 111010100011169. The reversal of 111010100011141 is 141110001010111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 61034687500900 + 49975412510241 = 7812470^2 + 7069329^2 .

It is a cyclic number.

It is not a de Polignac number, because 111010100011141 - 23 = 111010100011133 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (111050100011141) 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, 55505050005570 + 55505050005571.

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

Almost surely, 2111010100011141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 13.

Adding to 111010100011141 its reverse (141110001010111), we get a palindrome (252120101021252).

The spelling of 111010100011141 in words is "one hundred eleven trillion, ten billion, one hundred million, eleven thousand, one hundred forty-one".