1020000111111 has 16 divisors (see below), whose sum is σ = 1526689746400. Its totient is φ = 672989762304.

The previous prime is 1020000111077. The next prime is 1020000111161. The reversal of 1020000111111 is 1111110000201.

It is not a de Polignac number, because 1020000111111 - 2¹⁷ = 1019999980039 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194728216 + ... + 194733453.

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

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

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

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

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

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

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

Adding to 1020000111111 its reverse (1111110000201), we get a palindrome (2131110111312).

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