11076749150513 has 2 divisors, whose sum is σ = 11076749150514. Its totient is φ = 11076749150512.

The previous prime is 11076749150491. The next prime is 11076749150521. The reversal of 11076749150513 is 31505194767011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8110579976464 + 2966169174049 = 2847908^2 + 1722257^2 .

It is a cyclic number.

It is not a de Polignac number, because 11076749150513 - 2⁶ = 11076749150449 is a prime.

It is a super-3 number, since 3×11076749150513³ (a number of 40 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 793800, while the sum is 50.

The spelling of 11076749150513 in words is "eleven trillion, seventy-six billion, seven hundred forty-nine million, one hundred fifty thousand, five hundred thirteen".