Search a number
-
+
110121023011100 = 225223716469104243
BaseRepresentation
bin11001000010011110001100…
…011101010111100100011100
3112102220110121102200202000112
4121002132030131113210130
5103413210323342323400
61030112522150545152
732123660415242603
oct3102361435274434
9472813542622015
10110121023011100
11320a7077705732
12104262379681b8
13495a4a23c182a
141d29c590a4a3a
15cae7793e2835
hex64278c75791c

110121023011100 has 144 divisors (see below), whose sum is σ = 252905817991680. Its totient is φ = 41533014969600.

The previous prime is 110121023011081. The next prime is 110121023011141. The reversal of 110121023011100 is 1110320121011.

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

It is a super-2 number, since 2×1101210230111002 (a number of 29 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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, 1056335579 + ... + 1056439821.

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

Almost surely, 2110121023011100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110121023011100 its reverse (1110320121011), we get a palindrome (111231343132111).

The spelling of 110121023011100 in words is "one hundred ten trillion, one hundred twenty-one billion, twenty-three million, eleven thousand, one hundred".

Divisors: 1 2 4 5 10 20 23 25 46 50 71 92 100 115 142 230 284 355 460 575 710 1150 1420 1633 1775 2300 3266 3550 6469 6532 7100 8165 12938 16330 25876 32345 32660 40825 64690 81650 104243 129380 148787 161725 163300 208486 297574 323450 416972 459299 521215 595148 646900 743935 918598 1042430 1487870 1837196 2084860 2296495 2397589 2606075 2975740 3719675 4592990 4795178 5212150 7401253 7439350 9185980 9590356 10424300 10563877 11482475 11987945 14802506 14878700 21127754 22964950 23975890 29605012 37006265 42255508 45929900 47951780 52819385 59939725 74012530 105638770 119879450 148025060 170228819 185031325 211277540 239758900 264096925 340457638 370062650 528193850 674347967 680915276 740125300 851144095 1056387700 1348695934 1702288190 2697391868 3371739835 3404576380 4255720475 6743479670 8511440950 13486959340 15510003241 16858699175 17022881900 31020006482 33717398350 47878705657 62040012964 67434796700 77550016205 95757411314 155100032410 191514822628 239393528285 310200064820 387750081025 478787056570 775500162050 957574113140 1101210230111 1196967641425 1551000324100 2202420460222 2393935282850 4404840920444 4787870565700 5506051150555 11012102301110 22024204602220 27530255752775 55060511505550 110121023011100