Search a number
-
+
11100001110127 is a prime number
BaseRepresentation
bin1010000110000110101110…
…0111111000100001101111
31110022011001011101102100221
42201201223213320201233
52423330300241011002
635335134202232211
72223643242454336
oct241415347704157
943264034342327
1011100001110127
11359a536283076
1212b3307ab5667
13626958231b77
142a5358804d1d
15143b0aa62c37
hexa186b9f886f

11100001110127 has 2 divisors, whose sum is σ = 11100001110128. Its totient is φ = 11100001110126.

The previous prime is 11100001110089. The next prime is 11100001110139. The reversal of 11100001110127 is 72101110000111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11100001110127 - 215 = 11100001077359 is a prime.

It is a super-2 number, since 2×111000011101272 (a number of 27 digits) contains 22 as substring.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 211100001110127 is an apocalyptic number.

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

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

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

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

Adding to 11100001110127 its reverse (72101110000111), we get a palindrome (83201111110238).

The spelling of 11100001110127 in words is "eleven trillion, one hundred billion, one million, one hundred ten thousand, one hundred twenty-seven".