Search a number
-
+
201110141 is a prime number
BaseRepresentation
bin10111111110010…
…11001001111101
3112000102110020202
423333023021331
5402441011031
631542253245
74661256641
oct1377131175
9460373222
10201110141
11a3581031
1257427225
13328856ab
141c9d0c21
15129c82cb
hexbfcb27d

201110141 has 2 divisors, whose sum is σ = 201110142. Its totient is φ = 201110140.

The previous prime is 201110131. The next prime is 201110149. The reversal of 201110141 is 141011102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 116856100 + 84254041 = 10810^2 + 9179^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-201110141 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2201110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

The square root of 201110141 is about 14181.3307203520. The cubic root of 201110141 is about 585.8835757867.

Adding to 201110141 its reverse (141011102), we get a palindrome (342121243).

The spelling of 201110141 in words is "two hundred one million, one hundred ten thousand, one hundred forty-one".