Search a number
-
+
20002111011 = 323496368071
BaseRepresentation
bin10010101000001101…
…111111111000100011
31220121222111112000100
4102220031333320203
5311431020023021
613104442353443
71305446065311
oct225015777043
956558445010
1020002111011
118534741063
123a627bb883
131b69c6675c
14d7a6b50b1
157c1036626
hex4a837fe23

20002111011 has 12 divisors (see below), whose sum is σ = 28974727600. Its totient is φ = 13296530160.

The previous prime is 20002111009. The next prime is 20002111021. The reversal of 20002111011 is 11011120002.

It is a happy number.

It is not a de Polignac number, because 20002111011 - 21 = 20002111009 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 = 20002110984 and 20002111002.

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

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

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

Almost surely, 220002111011 is an apocalyptic number.

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

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

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

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

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

Adding to 20002111011 its reverse (11011120002), we get a palindrome (31013231013).

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

Divisors: 1 3 9 349 1047 3141 6368071 19104213 57312639 2222456779 6667370337 20002111011