11515011106913 has 2 divisors, whose sum is σ = 11515011106914. Its totient is φ = 11515011106912.

The previous prime is 11515011106903. The next prime is 11515011106979. The reversal of 11515011106913 is 31960111051511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9791942707264 + 1723068399649 = 3129208^2 + 1312657^2 .

It is an emirp because it is prime and its reverse (31960111051511) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11515011106913 - 2²⁶ = 11514943998049 is a prime.

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

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

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

It is an amenable number.

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

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

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

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

The spelling of 11515011106913 in words is "eleven trillion, five hundred fifteen billion, eleven million, one hundred six thousand, nine hundred thirteen".