Search a number
-
+
111111001001100 = 22355211344990121
BaseRepresentation
bin11001010000111000001011…
…101111101100110010001100
3112120102002220200221022100000
4121100320023233230302030
5104030420312224013400
61032151404511004300
732255335120306602
oct3120701357546214
9476362820838300
10111111001001100
1132448a02453131
1210566081509690
1349cc951264929
141d61b30499872
15cca3bad9e600
hex650e0bbecc8c

111111001001100 has 432 divisors, whose sum is σ = 365181950296800. Its totient is φ = 29301660057600.

The previous prime is 111111001001093. The next prime is 111111001001107. The reversal of 111111001001100 is 1100100111111.

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

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

It is not an unprimeable number, because it can be changed into a prime (111111001001107) by changing a digit.

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 143 ways as a sum of consecutive naturals, for example, 1232864040 + ... + 1232954160.

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

Almost surely, 2111111001001100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111111001001100 its reverse (1100100111111), we get a palindrome (112211101112211).

It can be divided in two parts, 11 and 1111001001100, that added together give a palindrome (1111001001111).

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