Search a number
-
+
110200210100 = 225217199325747
BaseRepresentation
bin110011010100001110…
…0011100001010110100
3101112110001010200222222
41212220130130022310
53301142223210400
6122343020541512
710650602221241
oct1465034341264
9345401120888
10110200210100
1142810166a02
12194359b1898
13a512b28a16
145495a1c5c8
152cee994185
hex19a871c2b4

110200210100 has 72 divisors (see below), whose sum is σ = 254474337600. Its totient is φ = 41278533120.

The previous prime is 110200210079. The next prime is 110200210103. The reversal of 110200210100 is 1012002011.

110200210100 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 not an unprimeable number, because it can be changed into a prime (110200210103) by changing a digit.

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 23 ways as a sum of consecutive naturals, for example, 175427 + ... + 501173.

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

Almost surely, 2110200210100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110200210100 its reverse (1012002011), we get a palindrome (111212212111).

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

Divisors: 1 2 4 5 10 17 20 25 34 50 68 85 100 170 199 340 398 425 796 850 995 1700 1990 3383 3980 4975 6766 9950 13532 16915 19900 33830 67660 84575 169150 325747 338300 651494 1302988 1628735 3257470 5537699 6514940 8143675 11075398 16287350 22150796 27688495 32574700 55376990 64823653 110753980 129647306 138442475 259294612 276884950 324118265 553769900 648236530 1102002101 1296473060 1620591325 2204004202 3241182650 4408008404 5510010505 6482365300 11020021010 22040042020 27550052525 55100105050 110200210100