Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …110011011011000001100 |
3 | 10220011120121221012121121 |
4 | 100000203232123120030 |
5 | 121011011404013400 |
6 | 2201214540410324 |
7 | 142323530135626 |
oct | 20004356333014 |
9 | 3804517835547 |
10 | 1100111001100 |
11 | 394610a86841 |
12 | 159260b469a4 |
13 | 7c980aa11b7 |
14 | 3b36211dc16 |
15 | 1d93a5ca21a |
hex | 10023b9b60c |
1100111001100 has 72 divisors (see below), whose sum is σ = 2397987144000. Its totient is φ = 438064704000.
The previous prime is 1100111001007. The next prime is 1100111001149. The reversal of 1100111001100 is 11001110011.
It is a happy number.
It is a zygodrome in base 10.
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, 111106150 + ... + 111116050.
It is an arithmetic number, because the mean of its divisors is an integer number (33305377000).
Almost surely, 21100111001100 is an apocalyptic number.
1100111001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100111001100 is an abundant number, since it is smaller than the sum of its proper divisors (1297876142900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100111001100 is a wasteful number, since it uses less digits than its factorization.
1100111001100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14803 (or 14796 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100111001100 its reverse (11001110011), we get a palindrome (1111112111111).
1100111001100 divided by its reverse (11001110011) gives a square (100 = 102).
It can be divided in two parts, 110011 and 1001100, that added together give a palindrome (1111111).
The spelling of 1100111001100 in words is "one trillion, one hundred billion, one hundred eleven million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •