Search a number
-
+
1111111112141 is a prime number
BaseRepresentation
bin10000001010110011011…
…000100001010111001101
310221012222020120202011122
4100022303120201113031
5121201023421042031
62210234251130325
7143163240423332
oct20126330412715
93835866522148
101111111112141
1139924628aaa8
1215b410a439a5
1380a14a37244
143bac701c989
151dd8118c47b
hex102b36215cd

1111111112141 has 2 divisors, whose sum is σ = 1111111112142. Its totient is φ = 1111111112140.

The previous prime is 1111111112099. The next prime is 1111111112197. The reversal of 1111111112141 is 1412111111111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 877508056516 + 233603055625 = 936754^2 + 483325^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 21111111112141 is an apocalyptic number.

It is an amenable number.

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

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

1111111112141 is an evil number, because the sum of its binary digits is even.

The product of its digits is 8, while the sum is 17.

Adding to 1111111112141 its reverse (1412111111111), we get a palindrome (2523222223252).

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