Search a number
-
+
110200112101200 = 243521119319432139
BaseRepresentation
bin11001000011100111110110…
…100010010011011101010000
3112110012000202021202210112210
4121003213312202103131100
5103421004312144214300
61030213122124352120
732132460336356322
oct3103476642233520
9473160667683483
10110200112101200
1132127672408710
121043962a6a5640
134964a978b01b4
141d2d9dcc83612
15cb185792c050
hex6439f6893750

110200112101200 has 240 divisors, whose sum is σ = 385120125734400. Its totient is φ = 26713734028800.

The previous prime is 110200112101187. The next prime is 110200112101207. The reversal of 110200112101200 is 2101211002011.

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

It is a tau number, because it is divible by the number of its divisors (240).

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

It is a congruent number.

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

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

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

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

Almost surely, 2110200112101200 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110200112101200 its reverse (2101211002011), we get a palindrome (112301323103211).

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