Search a number
-
+
10001000605500 = 22325316271365977
BaseRepresentation
bin1001000110001000101000…
…0101101010011100111100
31022102002022221001021112100
42101202022011222130330
52302324022123334000
633134221331305100
72051356055346432
oct221421205523474
938362287037470
1010001000605500
113206445130813
121156316a4b190
13577123548198
1426809dd96d52
15125237be3a00
hex9188a16a73c

10001000605500 has 144 divisors (see below), whose sum is σ = 31569237764064. Its totient is φ = 2665292371200.

The previous prime is 10001000605489. The next prime is 10001000605507. The reversal of 10001000605500 is 550600010001.

10001000605500 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 10 + 0 + 0 + 605 + 50 + 0 = 666.

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

It is a Harshad number since it is a multiple of its sum of digits (18).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10001000605507) 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, 6638512 + ... + 8004488.

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

Almost surely, 210001000605500 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10001000605500 its reverse (550600010001), we get a palindrome (10551600615501).

The spelling of 10001000605500 in words is "ten trillion, one billion, six hundred five thousand, five hundred".

Divisors: 1 2 3 4 5 6 9 10 12 15 18 20 25 30 36 45 50 60 75 90 100 125 150 180 225 250 300 375 450 500 750 900 1125 1500 1627 2250 3254 4500 4881 6508 8135 9762 14643 16270 19524 24405 29286 32540 40675 48810 58572 73215 81350 97620 122025 146430 162700 203375 244050 292860 366075 406750 488100 610125 732150 813500 1220250 1365977 1464300 1830375 2440500 2731954 3660750 4097931 5463908 6829885 7321500 8195862 12293793 13659770 16391724 20489655 24587586 27319540 34149425 40979310 49175172 61468965 68298850 81958620 102448275 122937930 136597700 170747125 204896550 245875860 307344825 341494250 409793100 512241375 614689650 682988500 1024482750 1229379300 1536724125 2048965500 2222444579 3073448250 4444889158 6146896500 6667333737 8889778316 11112222895 13334667474 20002001211 22224445790 26669334948 33336668685 40004002422 44448891580 55561114475 66673337370 80008004844 100010006055 111122228950 133346674740 166683343425 200020012110 222244457900 277805572375 333366686850 400040024220 500050030275 555611144750 666733373700 833416717125 1000100060550 1111222289500 1666833434250 2000200121100 2500250151375 3333666868500 5000500302750 10001000605500