Search a number
-
+
110201012000 = 25531071971307
BaseRepresentation
bin110011010100001111…
…1011111111100100000
3101112110002122102222222
41212220133133330200
53301142424341000
6122343050050212
710650612101162
oct1465037377440
9345402572888
10110201012000
1142810664432
1219436119968
13a513049a11
145495b8a932
152ceeaa1a85
hex19a87dff20

110201012000 has 192 divisors, whose sum is σ = 274891833216. Its totient is φ = 43413529600.

The previous prime is 110201011993. The next prime is 110201012023. The reversal of 110201012000 is 210102011.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84315347 + ... + 84316653.

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

Almost surely, 2110201012000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110201012000 its reverse (210102011), we get a palindrome (110411114011).

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