Search a number
-
+
111010011100141 is a prime number
BaseRepresentation
bin11001001111011010001000…
…010001110011001111101101
3112120001110020112121210020211
4121033122020101303033231
5104022242000320201031
61032033143422542421
732245131363311506
oct3117321021631755
9476043215553224
10111010011100141
113240a09927186a
121054a598137a11
1349c327864299a
141d5acadb99bad
15cc7959ccabb1
hex64f6884733ed

111010011100141 has 2 divisors, whose sum is σ = 111010011100142. Its totient is φ = 111010011100140.

The previous prime is 111010011100129. The next prime is 111010011100151. The reversal of 111010011100141 is 141001110010111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 106883238249225 + 4126772850916 = 10338435^2 + 2031446^2 .

It is a cyclic number.

It is not a de Polignac number, because 111010011100141 - 221 = 111010009002989 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2111010011100141 is an apocalyptic number.

It is an amenable number.

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

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

111010011100141 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 111010011100141 its reverse (141001110010111), we get a palindrome (252011121110252).

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