Search a number
-
+
110110100110 = 2567164343433
BaseRepresentation
bin110011010001100010…
…0101100101010001110
3101112012202120122022221
41212203010230222032
53301001141200420
6122330041325554
710645426260013
oct1464304545216
9345182518287
10110110100110
114277430aa3a
121940b7968ba
13a4ca2689ba
145487a8370a
152ce6ae4caa
hex19a312ca8e

110110100110 has 16 divisors (see below), whose sum is σ = 201156363216. Its totient is φ = 43386666048.

The previous prime is 110110100099. The next prime is 110110100119. The reversal of 110110100110 is 11001011011.

It is a happy number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110110100119) 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, 82171047 + ... + 82172386.

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

Almost surely, 2110110100110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 164343507.

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

Adding to 110110100110 its reverse (11001011011), we get a palindrome (121111111121).

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

Divisors: 1 2 5 10 67 134 335 670 164343433 328686866 821717165 1643434330 11011010011 22022020022 55055050055 110110100110