11001110010013 has 4 divisors (see below), whose sum is σ = 11001127248828. Its totient is φ = 11001092771200.

The previous prime is 11001110009999. The next prime is 11001110010067. The reversal of 11001110010013 is 31001001110011.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 6039099821764 + 4962010188249 = 2457458^2 + 2227557^2 .

It is a cyclic number.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11001110010413) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7623838 + ... + 8951263.

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

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

It is an amenable number.

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

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

11001110010013 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 17238814.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 11001110010013 its reverse (31001001110011), we get a palindrome (42002111120024).

The spelling of 11001110010013 in words is "eleven trillion, one billion, one hundred ten million, ten thousand, thirteen".