111111001013 has 2 divisors, whose sum is σ = 111111001014. Its totient is φ = 111111001012.

The previous prime is 111111001003. The next prime is 111111001031. The reversal of 111111001013 is 310100111111.

Together with next prime (111111001031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 110984258449 + 126742564 = 333143^2 + 11258^2 .

It is a cyclic number.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 111111000985 and 111111001003.

It is a congruent number.

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

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

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

Almost surely, 2^111111001013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 111111001013 its reverse (310100111111), we get a palindrome (421211112124).

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