11014143311137 has 2 divisors, whose sum is σ = 11014143311138. Its totient is φ = 11014143311136.

The previous prime is 11014143311029. The next prime is 11014143311179. The reversal of 11014143311137 is 73111334141011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8943425189136 + 2070718122001 = 2990556^2 + 1438999^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2^{11014143311137} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3024, while the sum is 31.

Adding to 11014143311137 its reverse (73111334141011), we get a palindrome (84125477452148).

The spelling of 11014143311137 in words is "eleven trillion, fourteen billion, one hundred forty-three million, three hundred eleven thousand, one hundred thirty-seven".