Search a number
-
+
111100000000000 = 21151111101
BaseRepresentation
bin11001010000101101111100…
…000010001101100000000000
3112120101001112000121112211211
4121100231330002031200000
5104030230300000000000
61032142345125215504
732254465366324234
oct3120557402154000
9476331460545754
10111100000000000
11324442776a1190
1210563b11261594
1349cb8ba07971b
141d613a94085c4
15cc9e751b37ba
hex650b7c08d800

111100000000000 has 576 divisors, whose sum is σ = 305925291715680. Its totient is φ = 40000000000000.

The previous prime is 111099999999979. The next prime is 111100000000037. The reversal of 111100000000000 is 1111.

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

It is a nialpdrome in base 10.

It is a zygodrome in base 10.

It is a junction number, because it is equal to n+sod(n) for n = 111099999999899 and 111099999999908.

It is a congruent number.

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 47 ways as a sum of consecutive naturals, for example, 1099999999950 + ... + 1100000000050.

Almost surely, 2111100000000000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111100000000000 its reverse (1111), we get a palindrome (111100000001111).

111100000000000 divided by its reverse (1111) gives a 11-th power (100000000000 = 1011).

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

The spelling of 111100000000000 in words is "one hundred eleven trillion, one hundred billion", and thus it is an aban number.