Search a number
-
+
111121101112110 = 23537435309438523
BaseRepresentation
bin11001010001000001100101…
…110000100100001100101110
3112120110001222121002002221120
4121101001211300210030232
5104031102003341041420
61032200155031241410
732256143321655435
oct3121014560441456
9476401877062846
10111121101112110
1132452215725011
121056801bb19266
134a008a090428b
141d6240ba3c11c
15cca7ac934d40
hex651065c2432e

111121101112110 has 128 divisors (see below), whose sum is σ = 280321660776960. Its totient is φ = 28155554090496.

The previous prime is 111121101112037. The next prime is 111121101112159. The reversal of 111121101112110 is 11211101121111.

It is a happy number.

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

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 111121101112110.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2111121101112110 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 443922.

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

Adding to 111121101112110 its reverse (11211101121111), we get a palindrome (122332202233221).

Subtracting from 111121101112110 its reverse (11211101121111), we obtain a palindrome (99909999990999).

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

Divisors: 1 2 3 5 6 10 15 30 37 43 74 86 111 129 185 215 222 258 370 430 555 645 1110 1290 1591 3182 4773 5309 7955 9546 10618 15910 15927 23865 26545 31854 47730 53090 79635 159270 196433 228287 392866 438523 456574 589299 684861 877046 982165 1141435 1178598 1315569 1369722 1964330 2192615 2282870 2631138 2946495 3424305 4385230 5892990 6577845 6848610 8446619 13155690 16225351 16893238 18856489 25339857 32450702 37712978 42233095 48676053 50679714 56569467 81126755 84466190 94282445 97352106 113138934 126699285 162253510 188564890 243380265 253398570 282847335 486760530 565694670 697690093 1395380186 2093070279 2328118607 3488450465 4186140558 4656237214 6976900930 6984355821 10465351395 11640593035 13968711642 20930702790 23281186070 34921779105 69843558210 86140388459 100109100101 172280776918 200218200202 258421165377 300327300303 430701942295 500545500505 516842330754 600654600606 861403884590 1001091001010 1292105826885 1501636501515 2584211653770 3003273003030 3704036703737 7408073407474 11112110111211 18520183518685 22224220222422 37040367037370 55560550556055 111121101112110