Search a number
-
+
100011011011110 = 2335232977218661
BaseRepresentation
bin10110101111010110100000…
…110010001111001000100110
3111010002221220022110211221000
4112233112200302033020212
5101102040022304323420
6552412231342534130
730031362041165403
oct2657264062171046
9433087808424830
10100011011011110
1129959482485861
12b272979297346
1343a5cc8427434
141a9a7b734b2aa
15b867b12d6690
hex5af5a0c8f226

100011011011110 has 192 divisors, whose sum is σ = 281669881268160. Its totient is φ = 25247061227520.

The previous prime is 100011011011097. The next prime is 100011011011123. The reversal of 100011011011110 is 11110110110001.

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

It is an interprime number because it is at equal distance from previous prime (100011011011097) and next prime (100011011011123).

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 = 100011011011092 and 100011011011101.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 10245180 + ... + 17463840.

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

Almost surely, 2100011011011110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100011011011110 its reverse (11110110110001), we get a palindrome (111121121121111).

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