Search a number
-
+
110222200120110 = 235131394351746723
BaseRepresentation
bin11001000011111100011011…
…000101011010001100101110
3112110021010202122021102021020
4121003330123011122030232
5103421340031212320420
61030231214003315010
732134201604420031
oct3103743305321456
9473233678242236
10110222200120110
1132135a775321a1
121044197397ba66
134966ba7a3c480
141d30ad65b7018
15cb21ebb45340
hex643f1b15a32e

110222200120110 has 128 divisors (see below), whose sum is σ = 286944239715840. Its totient is φ = 26935231504896.

The previous prime is 110222200120063. The next prime is 110222200120117. The reversal of 110222200120110 is 11021002222011.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 110222200120110.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2359033209 + ... + 2359079931.

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

Almost surely, 2110222200120110 is an apocalyptic number.

110222200120110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 110222200120110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143472119857920).

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

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

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

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

The sum of its prime factors is 90402.

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

Adding to 110222200120110 its reverse (11021002222011), we get a palindrome (121243202342121).

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

Divisors: 1 2 3 5 6 10 13 15 26 30 39 65 78 130 139 195 278 390 417 695 834 1390 1807 2085 3614 4170 5421 9035 10842 18070 27105 43517 46723 54210 87034 93446 130551 140169 217585 233615 261102 280338 435170 467230 565721 607399 652755 700845 1131442 1214798 1305510 1401690 1697163 1822197 2828605 3036995 3394326 3644394 5657210 6048863 6073990 6494497 8485815 9110985 12097726 12988994 16971630 18146589 18221970 19483491 30244315 32472485 36293178 38966982 60488630 64944970 78635219 84428461 90732945 97417455 157270438 168856922 181465890 194834910 235905657 253285383 393176095 422142305 471811314 506570766 786352190 844284610 1179528285 1266426915 2033244791 2359056570 2532853830 4066489582 6099734373 10166223955 12199468746 20332447910 26432182283 30498671865 52864364566 60997343730 79296546849 132160911415 158593093698 264321822830 282621025949 396482734245 565242051898 792965468490 847863077847 1413105129745 1695726155694 2826210259490 3674073337337 4239315389235 7348146674674 8478630778470 11022220012011 18370366686685 22044440024022 36740733373370 55111100060055 110222200120110