Search a number
-
+
20111001113 = 72999068971
BaseRepresentation
bin10010101110101101…
…011000011000011001
31220220120101201011002
4102232231120120121
5312141404013423
613123332314345
71311240455210
oct225655303031
956816351132
1020111001113
118590154885
123a931729b5
131b866a0878
14d8ad3c077
157ca895228
hex4aeb58619

20111001113 has 8 divisors (see below), whose sum is σ = 23776553280. Its totient is φ = 16643586960.

The previous prime is 20111001109. The next prime is 20111001121. The reversal of 20111001113 is 31110011102.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 20111001113 - 22 = 20111001109 is a prime.

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49534283 + ... + 49534688.

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

Almost surely, 220111001113 is an apocalyptic number.

It is an amenable number.

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

20111001113 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 99069007.

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 20111001113 its reverse (31110011102), we get a palindrome (51221012215).

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

Divisors: 1 7 29 203 99068971 693482797 2873000159 20111001113