Search a number
-
+
20002011111 = 322396628073
BaseRepresentation
bin10010101000001101…
…100111011111100111
31220121222022102222100
4102220031213133213
5311431003323421
613104440303143
71305445201125
oct225015473747
956558272870
1020002011111
118534682aa5
123a62771ab3
131b69c30144
14d7a68a915
157c1016c26
hex4a83677e7

20002011111 has 12 divisors (see below), whose sum is σ = 30147959088. Its totient is φ = 12754905504.

The previous prime is 20002011103. The next prime is 20002011137. The reversal of 20002011111 is 11111020002.

It is a happy number.

It is not a de Polignac number, because 20002011111 - 23 = 20002011103 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20002012111) 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, 48313830 + ... + 48314243.

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

Almost surely, 220002011111 is an apocalyptic number.

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

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

20002011111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 20002011111 its reverse (11111020002), we get a palindrome (31113031113).

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

Divisors: 1 3 9 23 69 207 96628073 289884219 869652657 2222445679 6667337037 20002011111