Search a number
-
+
111102013103100 = 223526130371999061
BaseRepresentation
bin11001010000101111110100…
…000001100101101111111100
3112120101020201022121210010220
4121100233310001211233330
5104030243410323244400
61032143321001101340
732254566312401415
oct3120576401455774
9476336638553126
10111102013103100
113244510aa78358
1210564393487850
1349cbb4b160ba6
141d6151a91480c
15cca041cb37a0
hex650bf4065bfc

111102013103100 has 144 divisors (see below), whose sum is σ = 326832659558496. Its totient is φ = 29131901568000.

The previous prime is 111102013103071. The next prime is 111102013103167. The reversal of 111102013103100 is 1301310201111.

111102013103100 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×1111020131031002 (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 111102013103100.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2111102013103100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 111102013103100 its reverse (1301310201111), we get a palindrome (112403323304211).

The spelling of 111102013103100 in words is "one hundred eleven trillion, one hundred two billion, thirteen million, one hundred three thousand, one hundred".

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 50 60 61 75 100 122 150 183 244 300 305 366 610 732 915 1220 1525 1830 3037 3050 3660 4575 6074 6100 9111 9150 12148 15185 18222 18300 30370 36444 45555 60740 75925 91110 151850 182220 185257 227775 303700 370514 455550 555771 741028 911100 926285 1111542 1852570 1999061 2223084 2778855 3705140 3998122 4631425 5557710 5997183 7996244 9262850 9995305 11115420 11994366 13894275 18525700 19990610 23988732 27788550 29985915 39981220 49976525 55577100 59971830 99953050 119943660 121942721 149929575 199906100 243885442 299859150 365828163 487770884 599718300 609713605 731656326 1219427210 1463312652 1829140815 2438854420 3048568025 3658281630 6071148257 6097136050 7316563260 9145704075 12142296514 12194272100 18213444771 18291408150 24284593028 30355741285 36426889542 36582816300 60711482570 72853779084 91067223855 121422965140 151778706425 182134447710 303557412850 364268895420 370340043677 455336119275 607114825700 740680087354 910672238550 1111020131031 1481360174708 1821344477100 1851700218385 2222040262062 3703400436770 4444080524124 5555100655155 7406800873540 9258501091925 11110201310310 18517002183850 22220402620620 27775503275775 37034004367700 55551006551550 111102013103100