Search a number
-
+
111000011141 is a prime number
BaseRepresentation
bin110011101100000011…
…1011100000110000101
3101121111210002210202202
41213120013130012011
53304312000324031
6122554231244245
711006453345555
oct1473007340605
9347453083682
10111000011141
11430906812a8
1219619819685
13a60c73c186
14552dd35165
152d49ccc2cb
hex19d81dc185

111000011141 has 2 divisors, whose sum is σ = 111000011142. Its totient is φ = 111000011140.

The previous prime is 111000011113. The next prime is 111000011153. The reversal of 111000011141 is 141110000111.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 107942474116 + 3057537025 = 328546^2 + 55295^2 .

It is a cyclic number.

It is not a de Polignac number, because 111000011141 - 26 = 111000011077 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2111000011141 is an apocalyptic number.

It is an amenable number.

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

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

111000011141 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 11.

Adding to 111000011141 its reverse (141110000111), we get a palindrome (252110011252).

The spelling of 111000011141 in words is "one hundred eleven billion, eleven thousand, one hundred forty-one".