Search a number
-
+
2011110110110 = 25201111011011
BaseRepresentation
bin11101010000111111100…
…000001111001110011110
321010021000201110220212201
4131100333200033032132
5230422223142010420
64135520301122114
7265204116611443
oct35207740171636
97107021426781
102011110110110
117059a8255a72
1228592485933a
1311785423221a
146d4a42239ca
15374a856c10a
hex1d43f80f39e

2011110110110 has 8 divisors (see below), whose sum is σ = 3619998198216. Its totient is φ = 804444044040.

The previous prime is 2011110110077. The next prime is 2011110110131. The reversal of 2011110110110 is 110110111102.

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

It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 201111011011 = 2011110110110 / (2 + 0 + 1 + 1 + 1 + 1 + 0 + 1 + 1 + 0 + 1 + 1 + 0).

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100555505496 + ... + 100555505515.

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

Almost surely, 22011110110110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 201111011018.

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

Adding to 2011110110110 its reverse (110110111102), we get a palindrome (2121220221212).

The spelling of 2011110110110 in words is "two trillion, eleven billion, one hundred ten million, one hundred ten thousand, one hundred ten".

Divisors: 1 2 5 10 201111011011 402222022022 1005555055055 2011110110110