Search a number
-
+
11221020137 is a prime number
BaseRepresentation
bin10100111001101001…
…10010110111101001
31001222000022212212102
422130310302313221
5140440040121022
65053241223145
7545032045265
oct123464626751
931860285772
1011221020137
114838a78568
122211a91ab5
13109a9614b2
147863a50a5
1545a19ba92
hex29cd32de9

11221020137 has 2 divisors, whose sum is σ = 11221020138. Its totient is φ = 11221020136.

The previous prime is 11221020011. The next prime is 11221020157. The reversal of 11221020137 is 73102012211.

It is an a-pointer prime, because the next prime (11221020157) can be obtained adding 11221020137 to its sum of digits (20).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8571241561 + 2649778576 = 92581^2 + 51476^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 211221020137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 168, while the sum is 20.

Adding to 11221020137 its reverse (73102012211), we get a palindrome (84323032348).

The spelling of 11221020137 in words is "eleven billion, two hundred twenty-one million, twenty thousand, one hundred thirty-seven".