Search a number
-
+
101133311100 = 223521736775393
BaseRepresentation
bin101111000110000000…
…0111101110001111100
3100200001011011111210220
41132030000331301330
53124110111423400
6114243205501340
710210114650333
oct1361400756174
9320034144726
10101133311100
1139988132548
1217725411850
1396c9554523
144c75790d1a
15296d9a07a0
hex178c03dc7c

101133311100 has 144 divisors (see below), whose sum is σ = 309966598368. Its totient is φ = 25370869760.

The previous prime is 101133311039. The next prime is 101133311107. The reversal of 101133311100 is 1113331101.

It is a super-2 number, since 2×1011333111002 (a number of 23 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 101133311100.

It is a congruent number.

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

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 47 ways as a sum of consecutive naturals, for example, 18750004 + ... + 18755396.

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

Almost surely, 2101133311100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101133311100 its reverse (1113331101), we get a palindrome (102246642201).

The spelling of 101133311100 in words is "one hundred one billion, one hundred thirty-three million, three hundred eleven thousand, one hundred".

Divisors: 1 2 3 4 5 6 10 12 15 17 20 25 30 34 50 51 60 68 75 85 100 102 150 170 204 255 300 340 425 510 850 1020 1275 1700 2550 3677 5100 5393 7354 10786 11031 14708 16179 18385 21572 22062 26965 32358 36770 44124 53930 55155 62509 64716 73540 80895 91681 91925 107860 110310 125018 134825 161790 183362 183850 187527 220620 250036 269650 275043 275775 312545 323580 366724 367700 375054 404475 458405 539300 550086 551550 625090 750108 808950 916810 937635 1100172 1103100 1250180 1375215 1562725 1617900 1833620 1875270 2292025 2750430 3125450 3750540 4584050 4688175 5500860 6250900 6876075 9168100 9376350 13752150 18752700 19830061 27504300 39660122 59490183 79320244 99150305 118980366 198300610 237960732 297450915 337111037 396601220 495751525 594901830 674222074 991503050 1011333111 1189803660 1348444148 1487254575 1685555185 1983006100 2022666222 2974509150 3371110370 4045332444 5056665555 5949018300 6742220740 8427775925 10113331110 16855551850 20226662220 25283327775 33711103700 50566655550 101133311100