1011011110913 has 2 divisors, whose sum is σ = 1011011110914. Its totient is φ = 1011011110912.

The previous prime is 1011011110909. The next prime is 1011011111009. The reversal of 1011011110913 is 3190111101101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 924659174464 + 86351936449 = 961592^2 + 293857^2 .

It is a cyclic number.

It is not a de Polignac number, because 1011011110913 - 2² = 1011011110909 is a prime.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 20.

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