Search a number
-
+
2000021002011 = 321631363340833
BaseRepresentation
bin11101000110101010100…
…010101001011100011011
321002012101220100212022100
4131012222202221130123
5230232020334031021
64130444051054443
7264332246006304
oct35065242513433
97065356325270
102000021002011
11701227795a1a
1228374aba1423
131167a7a088b6
146cb315997ab
1537059c7a626
hex1d1aa8a971b

2000021002011 has 12 divisors (see below), whose sum is σ = 2906642658088. Its totient is φ = 1325167288704.

The previous prime is 2000021001991. The next prime is 2000021002019. The reversal of 2000021002011 is 1102001200002.

It is not a de Polignac number, because 2000021002011 - 210 = 2000021000987 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 = 2000021001984 and 2000021002002.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 681668950 + ... + 681671883.

Almost surely, 22000021002011 is an apocalyptic number.

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

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

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

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

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

Adding to 2000021002011 its reverse (1102001200002), we get a palindrome (3102022202013).

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

Divisors: 1 3 9 163 489 1467 1363340833 4090022499 12270067497 222224555779 666673667337 2000021002011