Search a number
-
+
20011111011 = 3219117024041
BaseRepresentation
bin10010101000110000…
…010101001001100011
31220122121102202200200
4102220300111021203
5311440321023021
613105403320243
71305615431343
oct225060251143
956577382620
1020011111011
118539828981
123a65820083
131b6ba980b8
14d7b978d23
157c1c13126
hex4a8c15263

20011111011 has 12 divisors (see below), whose sum is σ = 30426250920. Its totient is φ = 12638596320.

The previous prime is 20011110971. The next prime is 20011111013. The reversal of 20011111011 is 11011111002.

It is not a de Polignac number, because 20011111011 - 26 = 20011110947 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 = 20011110984 and 20011111002.

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

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

Almost surely, 220011111011 is an apocalyptic number.

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

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

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

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

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

Adding to 20011111011 its reverse (11011111002), we get a palindrome (31022222013).

Subtracting from 20011111011 its reverse (11011111002), we obtain a palindrome (9000000009).

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

Divisors: 1 3 9 19 57 171 117024041 351072123 1053216369 2223456779 6670370337 20011111011