All positive integers have at least ‘1’ and themselves as divisors so they’re not included; zero has every number as a divisor. That said, the purpose of this page is NOT to find all divisors, it merely shows the relationship between divisors and number bases (if you want a list of divisors, check out this page).

You can try a few different ranges below. The format is “i, iv, s, x”.

• 100, (i), 2, 70 (example with x>60)
• 200, 220, 2, 20 (here, iv is larger than i so there will be negative values but they will be ignored)
• 500, (i) (s and x don’t need to be specified so the default values are used)
• 60 659, 606, 55, 10 (see what happens if s>x...)
• 51 891 840, 102, 2, 51 (purposely computed by multiplying a few divisors)
• 88 394 175, 88, (s), 44 (only s is not specified)
• 299 792 458, 299, 2, 30 (i=c, c being the speed of light in a vaccum)
• 1 000 000 000 000, 500, 2, 40
• Back to default [50, (i), 2, 36] - and best for mobile devices

Before you get (too) distracted, I highly suggest that you read the notes below :

• The lowest allowed value for s is 2 (the script overrides invalid values).
• The highest allowed value for x is 60 (the script overrides invalid values).
• You can set iv=i and it will copy the value from i—which can be a killer if you set i to a really big number.
• Negative values for i are ignored.
• Whatever you do, BE PATIENT! Some sequences can take a very long time to complete—and, computer performance aside, it will be your fault...

(Yes, I took some liberty with the bases as of base 37.)

Valid XHTML 1.0 Strict