Search a number
-
+
201011112000 = 2633535915773
BaseRepresentation
bin1011101100110100110…
…0100010100001000000
3201012211210212111102000
42323031030202201000
511243132321041000
6232202045424000
720344146155256
oct2731514424100
9635753774360
10201011112000
1178280594656
1232b5a26b000
1315c5594a0ba
149a2c4c25d6
1553670ed000
hex2ecd322840

201011112000 has 448 divisors, whose sum is σ = 750034771200. Its totient is φ = 52691097600.

The previous prime is 201011111999. The next prime is 201011112013. The reversal of 201011112000 is 211110102.

It is a happy number.

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

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12736114 + ... + 12751886.

Almost surely, 2201011112000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 201011112000 its reverse (211110102), we get a palindrome (201222222102).

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