Search a number
-
+
11055543137 is a prime number
BaseRepresentation
bin10100100101111011…
…00011001101100001
31001112110221210002122
422102331203031201
5140120204340022
65025010354025
7540652365122
oct122275431541
931473853078
1011055543137
114763625211
12218658b915
1310725a3b02
1476c40c049
1544a8b1742
hex292f63361

11055543137 has 2 divisors, whose sum is σ = 11055543138. Its totient is φ = 11055543136.

The previous prime is 11055543089. The next prime is 11055543157. The reversal of 11055543137 is 73134555011.

11055543137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10513631296 + 541911841 = 102536^2 + 23279^2 .

It is a cyclic number.

It is not a de Polignac number, because 11055543137 - 28 = 11055542881 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11055543097 and 11055543106.

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

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

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

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

Almost surely, 211055543137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 35.

The spelling of 11055543137 in words is "eleven billion, fifty-five million, five hundred forty-three thousand, one hundred thirty-seven".