Search a number
-
+
1100101110000 = 243541714391499
BaseRepresentation
bin10000000000100011001…
…000101100100011110000
310220011112221022200120120
4100000203020230203300
5121011001341010000
62201213544410240
7142323350101614
oct20004310544360
93804487280516
101100101110000
11394606440482
12159259776980
137c97ba1a089
143b360aa7344
151d9397c46a0
hex1002322c8f0

1100101110000 has 400 divisors, whose sum is σ = 3765294720000. Its totient is φ = 275727872000.

The previous prime is 1100101109993. The next prime is 1100101110019. The reversal of 1100101110000 is 111010011.

It is a tau number, because it is divible by the number of its divisors (400).

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 733889251 + ... + 733890749.

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

Almost surely, 21100101110000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1100101110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1882647360000).

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

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

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

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

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

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

Adding to 1100101110000 its reverse (111010011), we get a palindrome (1100212120011).

It can be divided in two parts, 11001011 and 10000, that added together give a palindrome (11011011).

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