Search a number
-
+
11101110001001 is a prime number
BaseRepresentation
bin1010000110001010110110…
…1101111101110101101001
31110022020220102221220200022
42201202231231331311221
52423340033130013001
635335440213450225
72224012566050336
oct241425555756551
943266812856608
1011101110001001
11359aa55210209
1212b3577340975
13626aa3ba6607
142a5421bb998d
15143b730a311b
hexa18adb7dd69

11101110001001 has 2 divisors, whose sum is σ = 11101110001002. Its totient is φ = 11101110001000.

The previous prime is 11101110000997. The next prime is 11101110001013. The reversal of 11101110001001 is 10010001110111.

Adding to 11101110001001 its reverse (10010001110111), we get a palindrome (21111111111112).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9309674982976 + 1791435018025 = 3051176^2 + 1338445^2 .

It is an emirp because it is prime and its reverse (10010001110111) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11101110001001 - 22 = 11101110000997 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11101110001001.

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

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

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

Almost surely, 211101110001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 8.

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