Search a number
-
+
11020000211141 is a prime number
BaseRepresentation
bin1010000001011100101100…
…1100101011000011000101
31110000111112202120200012012
42200113023030223003011
52421022430023224031
635234303533304005
72215111610156645
oct240271314530305
943014482520165
1011020000211141
113569612912629
12129b8bb935005
1361c248b73b0c
142a15298b4525
151419c7467b2b
hexa05cb32b0c5

11020000211141 has 2 divisors, whose sum is σ = 11020000211142. Its totient is φ = 11020000211140.

The previous prime is 11020000211089. The next prime is 11020000211177. The reversal of 11020000211141 is 14111200002011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10306963518916 + 713036692225 = 3210446^2 + 844415^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 211020000211141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 14.

Adding to 11020000211141 its reverse (14111200002011), we get a palindrome (25131200213152).

The spelling of 11020000211141 in words is "eleven trillion, twenty billion, two hundred eleven thousand, one hundred forty-one".