1020001101111 has 24 divisors (see below), whose sum is σ = 1478585371536. Its totient is φ = 677578151040.

The previous prime is 1020001101043. The next prime is 1020001101113. The reversal of 1020001101111 is 1111011000201.

It is not a de Polignac number, because 1020001101111 - 2⁷ = 1020001100983 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20208496 + ... + 20258906.

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

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

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

1020001101111 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 58383 (or 58380 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 1020001101111 its reverse (1111011000201), we get a palindrome (2131012101312).

The spelling of 1020001101111 in words is "one trillion, twenty billion, one million, one hundred one thousand, one hundred eleven".