Search a number
-
+
2011021020021 = 31351564641539
BaseRepresentation
bin11101010000111010001…
…100011000101101110101
321010020210111211200020210
4131100322030120231311
5230422032340120041
64135503355420033
7265201655425536
oct35207214305565
97106714750223
102011021020021
11705961a362a2
122858baa54619
1311783b93b4b0
146d49647268d
15374a0820016
hex1d43a318b75

2011021020021 has 8 divisors (see below), whose sum is σ = 2887619926240. Its totient is φ = 1237551396912.

The previous prime is 2011021020013. The next prime is 2011021020053. The reversal of 2011021020021 is 1200201201102.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 2011021020021 - 23 = 2011021020013 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25782320731 + ... + 25782320808.

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

Almost surely, 22011021020021 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 51564641555.

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

Adding to 2011021020021 its reverse (1200201201102), we get a palindrome (3211222221123).

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

Divisors: 1 3 13 39 51564641539 154693924617 670340340007 2011021020021