Search a number
-
+
101100111100110 = 23251729127157114277
BaseRepresentation
bin10110111111001100110100…
…001101010111100011001110
3111020222002001120102202201100
4112333030310031113203032
5101222411011420200420
6555004425545323530
730203146000202643
oct2677146415274316
9436862046382640
10101100111100110
112a239353050341
12b409a667965a6
134454912c50215
141ad73b2d59dca
15ba4ca4db9190
hex5bf3343578ce

101100111100110 has 384 divisors, whose sum is σ = 292037959249920. Its totient is φ = 24151239770112.

The previous prime is 101100111100063. The next prime is 101100111100117. The reversal of 101100111100110 is 11001111001101.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101100111100117) by changing a digit.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 884636292 + ... + 884750568.

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

Almost surely, 2101100111100110 is an apocalyptic number.

101100111100110 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 101100111100110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146018979624960).

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

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

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

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

The sum of its prime factors is 114620 (or 114617 counting only the distinct ones).

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

Adding to 101100111100110 its reverse (11001111001101), we get a palindrome (112101222101211).

Subtracting from 101100111100110 its reverse (11001111001101), we obtain a palindrome (90099000099009).

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