Search a number
-
+
110110001110 = 2529379689659
BaseRepresentation
bin110011010001100010…
…0010100011111010110
3101112012202101121112021
41212203010110133112
53301001130013420
6122330035243354
710645425365254
oct1464304243726
9345182347467
10110110001110
114277425261a
121940b74955a
13a4ca232915
145487a595d4
152ce6ac57aa
hex19a31147d6

110110001110 has 16 divisors (see below), whose sum is σ = 205032416400. Its totient is φ = 42525241696.

The previous prime is 110110001101. The next prime is 110110001153. The reversal of 110110001110 is 11100011011.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2110110001110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 379689695.

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

Adding to 110110001110 its reverse (11100011011), we get a palindrome (121210012121).

Subtracting from 110110001110 its reverse (11100011011), we obtain a palindrome (99009990099).

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

Divisors: 1 2 5 10 29 58 145 290 379689659 759379318 1898448295 3796896590 11011000111 22022000222 55055000555 110110001110