Search a number
-
+
20001112000 = 265317241211
BaseRepresentation
bin10010101000001010…
…001011111111000000
31220121220121202121221
4102220022023333000
5311430241041000
613104405124424
71305434434612
oct225012137700
956556552557
1020001112000
118534119531
123a623b9714
131b699a6b1c
14d7a4d4db2
157c0dda61a
hex4a828bfc0

20001112000 has 336 divisors, whose sum is σ = 54156656736. Its totient is φ = 7311360000.

The previous prime is 20001111989. The next prime is 20001112003. The reversal of 20001112000 is 21110002.

It is a congruent number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 94791895 + ... + 94792105.

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

Almost surely, 220001112000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 20001112000 its reverse (21110002), we get a palindrome (20022222002).

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