Search a number
-
+
20010111111 = 3220891064311
BaseRepresentation
bin10010101000101100…
…100001000010000111
31220122112112222002100
4102220230201002013
5311440042023421
613105330043143
71305604065234
oct225054410207
956575488070
1020010111111
118539205711
123a654194b3
131b6b807c43
14d7b79878b
157c1ab6c26
hex4a8b21087

20010111111 has 12 divisors (see below), whose sum is σ = 28917357040. Its totient is φ = 13333675680.

The previous prime is 20010111091. The next prime is 20010111139. The reversal of 20010111111 is 11111101002.

It is not a de Polignac number, because 20010111111 - 215 = 20010078343 is a prime.

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

It is a Duffinian number.

20010111111 is a modest number, since divided by 111111 gives 20010 as remainder.

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

It is a congruent number.

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

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

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

Almost surely, 220010111111 is an apocalyptic number.

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

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

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

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

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

Adding to 20010111111 its reverse (11111101002), we get a palindrome (31121212113).

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

Divisors: 1 3 9 2089 6267 18801 1064311 3192933 9578799 2223345679 6670037037 20010111111