Search a number
-
+
110011001100 = 2235271113379901
BaseRepresentation
bin110011001110100101…
…0101010100100001100
3101111221212002220001020
41212131022222210030
53300300304013400
6122312141314140
710643114036430
oct1463512524414
9344855086036
10110011001100
1142723384430
12193a2565950
13a4b287c330
1454788489c0
152cdd06c2a0
hex199d2aa90c

110011001100 has 576 divisors, whose sum is σ = 438960571392. Its totient is φ = 20528640000.

The previous prime is 110011001083. The next prime is 110011001123. The reversal of 110011001100 is 1100110011.

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

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.

110011001100 is a modest number, since divided by 11001100 gives 1100 as remainder.

It is a zygodrome in base 10.

It is an unprimeable number.

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 11106150 + ... + 11116050.

Almost surely, 2110011001100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110011001100 its reverse (1100110011), we get a palindrome (111111111111).

110011001100 divided by its reverse (1100110011) gives a square (100 = 102).

It can be divided in two parts, 11001 and 1001100, that added together give a palindrome (1012101).

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