Search a number
-
+
101100120010110 = 2325132109151403849
BaseRepresentation
bin10110111111001100110100…
…101111010110110101111110
3111020222002002012012102221100
4112333030310233112311332
5101222411021210310420
6555004430504313530
730203146136012424
oct2677146457266576
9436862065172840
10101100120010110
112a239358086581
12b409a697728a6
134454914a4c900
141ad73b41d9114
15ba4ca5a79190
hex5bf334bd6d7e

101100120010110 has 288 divisors, whose sum is σ = 289150073784000. Its totient is φ = 24494511974400.

The previous prime is 101100120010067. The next prime is 101100120010139. The reversal of 101100120010110 is 11010021001101.

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

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 250139466 + ... + 250543314.

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

Almost surely, 2101100120010110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101100120010110 its reverse (11010021001101), we get a palindrome (112110141011211).

Subtracting from 101100120010110 its reverse (11010021001101), we obtain a palindrome (90090099009009).

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