Search a number
-
+
20111112000 = 263353747283
BaseRepresentation
bin10010101110101101…
…110011011101000000
31220220120121100021000
4102232231303131000
5312141421041000
613123334532000
71311241426410
oct225655633500
956816540230
1020111112000
118590220121
123a93207000
131b8670c195
14d8ad6a640
157ca8b8000
hex4aeb73740

20111112000 has 896 divisors, whose sum is σ = 86424698880. Its totient is φ = 4483123200.

The previous prime is 20111111981. The next prime is 20111112023. The reversal of 20111112000 is 21111102.

It is a happy number.

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 an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 71063859 + ... + 71064141.

Almost surely, 220111112000 is an apocalyptic number.

20111112000 is a gapful number since it is divisible by the number (20) 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 20111112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43212349440).

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

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

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

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

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

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

Adding to 20111112000 its reverse (21111102), we get a palindrome (20132223102).

The spelling of 20111112000 in words is "twenty billion, one hundred eleven million, one hundred twelve thousand".