Search a number
-
+
11011101111161 is a prime number
BaseRepresentation
bin1010000000111011100011…
…0001010011001101111001
31102222122120120100112222122
42200032320301103031321
52420401213341024121
635230232514531025
72214345231110024
oct240167061231571
942878516315878
1011011101111161
113565866578048
12129a037596a75
1361b45b290b98
142a0d23a461bb
1514165606c5ab
hexa03b8c53379

11011101111161 has 2 divisors, whose sum is σ = 11011101111162. Its totient is φ = 11011101111160.

The previous prime is 11011101111091. The next prime is 11011101111203. The reversal of 11011101111161 is 16111110111011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11008832017936 + 2269093225 = 3317956^2 + 47635^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011101111161 - 242 = 6613054600057 is a prime.

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

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

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

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

Almost surely, 211011101111161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 17.

Adding to 11011101111161 its reverse (16111110111011), we get a palindrome (27122211222172).

The spelling of 11011101111161 in words is "eleven trillion, eleven billion, one hundred one million, one hundred eleven thousand, one hundred sixty-one".