Search a number
-
+
111113100000 = 25335575879
BaseRepresentation
bin110011101111011011…
…0110101101011100000
3101121210122220022112000
41213132312311223200
53310024423200000
6123013351204000
711012325523650
oct1473666655340
9347718808460
10111113100000
11431394a2671
121964b676600
13a629cb6466
145540d72360
152d54bba000
hex19dedb5ae0

111113100000 has 576 divisors, whose sum is σ = 463020364800. Its totient is φ = 25392960000.

The previous prime is 111113099953. The next prime is 111113100001. The reversal of 111113100000 is 1311111.

It is a super-2 number, since 2×1111131000002 (a number of 23 digits) contains 22 as substring.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

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

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

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

Almost surely, 2111113100000 is an apocalyptic number.

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

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

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

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

111113100000 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 111113100000 its reverse (1311111), we get a palindrome (111114411111).

The spelling of 111113100000 in words is "one hundred eleven billion, one hundred thirteen million, one hundred thousand".