Search a number
BaseRepresentation
bin10000000000100011101…
…010111111011000100000
310220011120120020102112112
4100000203222333120200
5121011011141200000
62201214505214452
7142323516363542
oct20004352773040
93804516212475
101100110100000
1139461052082a
12159260791428
137c980846cc2
143b361d67692
151d93a49d235
hex10023abf620

1100110100000 has 144 divisors (see below), whose sum is σ = 2719110715776. Its totient is φ = 438096480000.

The previous prime is 1100110099961. The next prime is 1100110100051. The reversal of 1100110100000 is 10110011.

Adding to 1100110100000 its reverse (10110011), we get a palindrome (1100120210011).

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

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22675769 + ... + 22724231.

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

Almost surely, 21100110100000 is an apocalyptic number.

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

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

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

1100110100000 is an frugal number, since it uses more digits than its factorization.

1100110100000 is an evil number, because the sum of its binary digits is even.

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

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

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