Search a number
-
+
110201022000 = 24325337337491
BaseRepresentation
bin110011010100001111…
…1100010011000110000
3101112110002122221201100
41212220133202120300
53301142430201000
6122343050204400
710650612142266
oct1465037423060
9345402587640
10110201022000
11428106709a3
1219436123700
13a513051434
145495b90436
152ceeaa4a00
hex19a87e2630

110201022000 has 480 divisors, whose sum is σ = 397278483264. Its totient is φ = 28449792000.

The previous prime is 110201021999. The next prime is 110201022017. The reversal of 110201022000 is 220102011.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

Almost surely, 2110201022000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110201022000 its reverse (220102011), we get a palindrome (110421124011).

The spelling of 110201022000 in words is "one hundred ten billion, two hundred one million, twenty-two thousand".