1101000011113 has 2 divisors, whose sum is σ = 1101000011114. Its totient is φ = 1101000011112.

The previous prime is 1101000011093. The next prime is 1101000011117. The reversal of 1101000011113 is 3111100001011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 861828152409 + 239171858704 = 928347^2 + 489052^2 .

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 1101000011113.

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

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

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

It is an amenable number.

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

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

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

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

Adding to 1101000011113 its reverse (3111100001011), we get a palindrome (4212100012124).

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