Search a number
-
+
110110101110 = 2511011010111
BaseRepresentation
bin110011010001100010…
…0101100111001110110
3101112012202120200200222
41212203010230321312
53301001141213420
6122330041334342
710645426262642
oct1464304547166
9345182520628
10110110101110
1142774310769
121940b7973b2
13a4ca2692a9
145487a83c22
152ce6ae5225
hex19a312ce76

110110101110 has 8 divisors (see below), whose sum is σ = 198198182016. Its totient is φ = 44044040440.

The previous prime is 110110101103. The next prime is 110110101133. The reversal of 110110101110 is 11101011011.

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2110110101110 is an apocalyptic number.

110110101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 11011010118.

The product of its (nonzero) digits is 1, while the sum is 8.

Adding to 110110101110 its reverse (11101011011), we get a palindrome (121211112121).

Subtracting from 110110101110 its reverse (11101011011), we obtain a palindrome (99009090099).

The spelling of 110110101110 in words is "one hundred ten billion, one hundred ten million, one hundred one thousand, one hundred ten".

Divisors: 1 2 5 10 11011010111 22022020222 55055050555 110110101110