Search a number
-
+
200010112000 = 210531982241
BaseRepresentation
bin1011101001000110001…
…0000001110000000000
3201010021001022102112221
42322101202001300000
511234110042041000
6231514450500424
720310302621026
oct2722142016000
9633231272487
10200010112000
1177907548526
123291ab94714
1315b2644c9ca
149975594716
1553092c061a
hex2e91881c00

200010112000 has 176 divisors, whose sum is σ = 525250046880. Its totient is φ = 75792384000.

The previous prime is 200010111997. The next prime is 200010112013. The reversal of 200010112000 is 211010002.

200010112000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2390880 + ... + 2473120.

Almost surely, 2200010112000 is an apocalyptic number.

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

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

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

200010112000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 200010112000 its reverse (211010002), we get a palindrome (200221122002).

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