Search a number
-
+
11021141137 is a prime number
BaseRepresentation
bin10100100001110100…
…10100010010010001
31001110002012222102111
422100322110102101
5140032403004022
65021341145321
7540054103546
oct122072242221
931402188374
1011021141137
114746168506
122176b5b241
13106841a2b6
14767a14bcd
15447868477
hex290e94491

11021141137 has 2 divisors, whose sum is σ = 11021141138. Its totient is φ = 11021141136.

The previous prime is 11021141071. The next prime is 11021141143. The reversal of 11021141137 is 73114112011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10482483456 + 538657681 = 102384^2 + 23209^2 .

It is a cyclic number.

It is not a de Polignac number, because 11021141137 - 27 = 11021141009 is a prime.

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

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

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

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

Almost surely, 211021141137 is an apocalyptic number.

It is an amenable number.

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

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

11021141137 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 22.

Adding to 11021141137 its reverse (73114112011), we get a palindrome (84135253148).

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