Search a number
-
+
100211121020120 = 235117111712739353
BaseRepresentation
bin10110110010010000111000…
…010001010101110011011000
3111010211002102022202120102012
4112302100320101111303120
5101113324333440120440
6553044204202525052
730052004666202365
oct2662207021256330
9433732368676365
10100211121020120
1129a263303543a0
12b2a5705806788
1343bbb39482aa6
141aa635bca746c
15b8bac423ae65
hex5b2438455cd8

100211121020120 has 128 divisors (see below), whose sum is σ = 249650259770880. Its totient is φ = 35896468608000.

The previous prime is 100211121020113. The next prime is 100211121020123. The reversal of 100211121020120 is 21020121112001.

100211121020120 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×1002111210201202 (a number of 29 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 100211121020095 and 100211121020104.

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35212364 + ... + 37951716.

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

Almost surely, 2100211121020120 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100211121020120 its reverse (21020121112001), we get a palindrome (121231242132121).

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

Divisors: 1 2 4 5 8 10 11 20 22 40 44 55 71 88 110 142 220 284 355 440 568 710 781 1171 1420 1562 2342 2840 3124 3905 4684 5855 6248 7810 9368 11710 12881 15620 23420 25762 31240 46840 51524 64405 83141 103048 128810 166282 257620 332564 415705 515240 665128 831410 914551 1662820 1829102 2739353 3325640 3658204 4572755 5478706 7316408 9145510 10957412 13696765 18291020 21914824 27393530 30132883 36582040 54787060 60265766 109574120 120531532 150664415 194494063 241063064 301328830 388988126 602657660 777976252 972470315 1205315320 1555952504 1944940630 2139434693 3207782363 3889881260 4278869386 6415564726 7779762520 8557738772 10697173465 12831129452 16038911815 17115477544 21394346930 25662258904 32077823630 35285605993 42788693860 64155647260 70571211986 85577387720 128311294520 141142423972 176428029965 227752547773 282284847944 352856059930 455505095546 705712119860 911010191092 1138762738865 1411424239720 1822020382184 2277525477730 2505278025503 4555050955460 5010556051006 9110101910920 10021112102012 12526390127515 20042224204024 25052780255030 50105560510060 100211121020120