Search a number
-
+
111111111100000 = 255511412719091
BaseRepresentation
bin11001010000111000010010…
…010011101100011001100000
3112120102010012101002220122001
4121100320102103230121200
5104030421023420200000
61032151423442453344
732255340625162624
oct3120702223543140
9476363171086561
10111111111100000
1132448a59612060
12105660b2364254
1349cc96b002ccb
141d61b40d59184
15cca3c589b46a
hex650e124ec660

111111111100000 has 576 divisors, whose sum is σ = 306712627135488. Its totient is φ = 39268800000000.

The previous prime is 111111111099913. The next prime is 111111111100021. The reversal of 111111111100000 is 1111111111.

It is a happy number.

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

It is a nialpdrome in base 10.

It is a zygodrome in base 10.

It is a self number, because there is not a number n which added to its sum of digits gives 111111111100000.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 12222095455 + ... + 12222104545.

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

Almost surely, 2111111111100000 is an apocalyptic number.

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

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

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

111111111100000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 111111111100000 its reverse (1111111111), we get a palindrome (111112222211111).

111111111100000 divided by its reverse (1111111111) gives a 5-th power (100000 = 105).

It can be divided in two parts, 11111 and 1111100000, that added together give a palindrome (1111111111).

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