Search a number
-
+
11001010111141 is a prime number
BaseRepresentation
bin1010000000010101111101…
…0011001100001010100101
31102221200112022100122022011
42200011133103030022211
52420220032042024031
635221443321434221
72213540200035631
oct240053723141245
942850468318264
1011001010111141
113561558459406
1212980a003b971
1361a51079155b
142a0647795dc1
151412651d66b1
hexa015f4cc2a5

11001010111141 has 2 divisors, whose sum is σ = 11001010111142. Its totient is φ = 11001010111140.

The previous prime is 11001010111139. The next prime is 11001010111153. The reversal of 11001010111141 is 14111101010011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8640930686116 + 2360079425025 = 2939546^2 + 1536255^2 .

It is a cyclic number.

It is not a de Polignac number, because 11001010111141 - 21 = 11001010111139 is a prime.

Together with 11001010111139, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 211001010111141 is an apocalyptic number.

It is an amenable number.

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

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

11001010111141 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 13.

Adding to 11001010111141 its reverse (14111101010011), we get a palindrome (25112111121152).

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