Search a number
-
+
1101010110110 = 25110101011011
BaseRepresentation
bin10000000001011001010…
…100010000011010011110
310220020220021202200022022
4100001121110100122132
5121014332042010420
62201444055420142
7142355025343661
oct20013124203236
93806807680268
101101010110110
11394a3255a739
12159472084652
137ca95145171
143b4096c76d8
151d98e4ccc25
hex1005951069e

1101010110110 has 8 divisors (see below), whose sum is σ = 1981818198216. Its totient is φ = 440404044040.

The previous prime is 1101010110073. The next prime is 1101010110131. The reversal of 1101010110110 is 110110101011.

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 polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55050505496 + ... + 55050505515.

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

Almost surely, 21101010110110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 110101011018.

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

Adding to 1101010110110 its reverse (110110101011), we get a palindrome (1211120211121).

Subtracting from 1101010110110 its reverse (110110101011), we obtain a palindrome (990900009099).

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

Divisors: 1 2 5 10 110101011011 220202022022 550505055055 1101010110110