Search a number
-
+
110100100110 = 235711136195923
BaseRepresentation
bin110011010001001111…
…0100011010000001110
3101112012001202120220120
41212202132203100032
53300441111200420
6122325043125410
710645245260340
oct1464236432016
9345161676816
10110100100110
11427696aa880
1219408373866
13a4c8177140
1454865dd290
152ce5cbbd40
hex19a27a340e

110100100110 has 256 divisors, whose sum is σ = 355417251840. Its totient is φ = 21080424960.

The previous prime is 110100100091. The next prime is 110100100139. The reversal of 110100100110 is 11001001011.

110100100110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a Harshad number since it is a multiple of its sum of digits (6).

It is a congruent number.

It is an unprimeable number.

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 127 ways as a sum of consecutive naturals, for example, 18585609 + ... + 18591531.

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

Almost surely, 2110100100110 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 110100100110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177708625920).

110100100110 is an abundant number, since it is smaller than the sum of its proper divisors (245317151730).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 6583.

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

Adding to 110100100110 its reverse (11001001011), we get a palindrome (121101101121).

Subtracting from 110100100110 its reverse (11001001011), we obtain a palindrome (99099099099).

It can be divided in two parts, 1101001001 and 10, that added together give a palindrome (1101001011).

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