1020021101022 has 128 divisors (see below), whose sum is σ = 2628352032768. Its totient is φ = 256216464000.

The previous prime is 1020021100997. The next prime is 1020021101069. The reversal of 1020021101022 is 2201011200201.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1752283 + ... + 2260649.

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

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

It is a practical number, because each smaller number is the sum of distinct divisors of 1020021101022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1314176016384).

1020021101022 is an abundant number, since it is smaller than the sum of its proper divisors (1608330931746).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 508534.

The product of its (nonzero) digits is 16, while the sum is 12.

Adding to 1020021101022 its reverse (2201011200201), we get a palindrome (3221032301223).

The spelling of 1020021101022 in words is "one trillion, twenty billion, twenty-one million, one hundred one thousand, twenty-two".