Search a number
-
+
110311102200 = 233521328150329
BaseRepresentation
bin110011010111100001…
…1011101011011111000
3101112201202210121100210
41212233003131123320
53301404120232300
6122402021431120
710653416616645
oct1465703353370
9345652717323
10110311102200
1142867817872
1219466b6b4a0
13a52cab4150
1454a6646dcc
152d0959b050
hex19af0dd6f8

110311102200 has 192 divisors, whose sum is σ = 369587282400. Its totient is φ = 27056332800.

The previous prime is 110311102193. The next prime is 110311102201. The reversal of 110311102200 is 2201113011.

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 (110311102201) by changing a digit.

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

Almost surely, 2110311102200 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110311102200 its reverse (2201113011), we get a palindrome (112512215211).

The spelling of 110311102200 in words is "one hundred ten billion, three hundred eleven million, one hundred two thousand, two hundred".