Search a number
-
+
11100100010141 is a prime number
BaseRepresentation
bin1010000110000111000110…
…0001001010000010011101
31110022011022001111001200102
42201201301201022002131
52423331001100311031
635335152054110445
72223645553215512
oct241416141120235
943264261431612
1011100100010141
11359a58709311a
1212b333504b425
1362697287ba9c
142a53679cb309
15143b1459b7cb
hexa187184a09d

11100100010141 has 2 divisors, whose sum is σ = 11100100010142. Its totient is φ = 11100100010140.

The previous prime is 11100100010099. The next prime is 11100100010147. The reversal of 11100100010141 is 14101000100111.

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., 5750662986916 + 5349437023225 = 2398054^2 + 2312885^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 211100100010141 is an apocalyptic number.

It is an amenable number.

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

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

11100100010141 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 11100100010141 its reverse (14101000100111), we get a palindrome (25201100110252).

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