Search a number
-
+
1101101010110 = 25157701338223
BaseRepresentation
bin10000000001011110101…
…111000000110010111110
310220021010121210212122222
4100001132233000302332
5121020023324310420
62201501104005342
7142360211105363
oct20013657006276
93807117725588
101101101010110
11394a798a6202
12159498600852
137caaac2094a
143b4177ca46a
151d997486225
hex1005ebc0cbe

1101101010110 has 16 divisors (see below), whose sum is σ = 1994605909056. Its totient is φ = 437635050528.

The previous prime is 1101101010109. The next prime is 1101101010127. The reversal of 1101101010110 is 110101011011.

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

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

Almost surely, 21101101010110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 701338387.

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

Adding to 1101101010110 its reverse (110101011011), we get a palindrome (1211202021121).

Subtracting from 1101101010110 its reverse (110101011011), we obtain a palindrome (990999999099).

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

Divisors: 1 2 5 10 157 314 785 1570 701338223 1402676446 3506691115 7013382230 110110101011 220220202022 550550505055 1101101010110