onlineintegertools logo

Integer as a product rewriter

World's simplest integer tool

This browser-based utility rewrites an integer as a product of several integer factors and prints the multiplicative decomposition in the output. You can find all possible products or just a specific number of products. You can change the order of multipliers and exclude the trivial factor "1". You can also change the multiplication symbol and use a custom output format for the factors. Created by math nerds from team Browserling.
love math? check out our math tools!
We also have Online Math Tools — utilities for doing mathy things. Check it out!
Products and Factors
How many integer products to find?
Allow using the trivial factor "1" in integer products?
Multiplication Characters
Enter the symbol you want to use as the multiplication symbol.
Insert this symbol between products. (Newline by default).
Open product character.
Close product character.
Factor Sorting
Print the largest factor on the right.
Print the largest factor on the left.
Print integer factors in mixed order.
Integer as a product rewriter tool What is a integer as a product rewriter?
With this online application, you can disassemble an integer into a bunch of smaller integers that when multiplied together produce the original integer. This is done by finding all possible divisors of the given integer and then combining them in all possible ways so that their product equals the dividend. For example, if you enter the integer 20 as input data, the program will calculate its divisors, which are 1, 2, 4, 5, 10, 20. Then, it will combine and multiply these factors and find which ones create 20. These combinations are 1 × 20, 1 × 2 × 10, 1 × 4 × 5, 1 × 2 × 2 × 5. The multiplier "1" (also called the trivial multiplier) has no effect on the product as anything multiplied by one equals the same value. You can turn off the trivial multiplier in the options and avoid using "1". In this case, you'll get only three products: 2 × 10, 4 × 5, 2 × 2 × 5. If the input integer is an integer prime, for example, 7, then it has only two divisors, 1 and 7, and can be expressed in only one way as 1 × 7. According to the commutative property of multiplication, the product 1 × 7 is the same as 7 × 1, so we only print one result. If the trivial divisor option is turned off, then there are no results. You can change the order of the multipliers and sort them in increasing order, decreasing order, or random order. The number of multiplicative partitions depends on the number of divisors and how well they combine together. For example, for the integer 8192, there are 101 different products but for the integer 8193, there are only 2. To avoid unpredictably long calculations for large integers, we limit the number of products to 100, but you can increase or decrease this amount in the options. You can also customize the output format of products. For example, you can replace the default multiplying character "×" with "*", or "·", or any other. If you're doing programming, then you can also put the products in brackets, for example, {1 × 7}, (1 × 7), or [1 × 7], and change the separator between individual products. By default, it's the newline "\n", so all products form a vertical column and each product goes on a separate line, but you can use a comma or a semicolon. Integerabulous!
Integer as a product rewriter examples Click to use
Print All Integer Products
In this example, we decompose the integer 100 into several products that use smaller integers. The value 100 is an even integer that has nine divisors including 1 and itself. These divisors are 1, 2, 4, 5, 10, 20, 25, 50, 100. From all these terms, the algorithm creates nine combinations that multiply up to the original value 100. We display each product on a new row, arranging the factors in ascending order, and using the Unicode "×" symbol as the multiplication character.
100
1 × 100 1 × 2 × 50 1 × 4 × 25 1 × 5 × 20 1 × 10 × 10 1 × 2 × 2 × 25 1 × 2 × 5 × 10 1 × 4 × 5 × 5 1 × 2 × 2 × 5 × 5
Required options
These options will be used automatically if you select this example.
How many integer products to find?
Allow using the trivial factor "1" in integer products?
Enter the symbol you want to use as the multiplication symbol.
Insert this symbol between products. (Newline by default).
Open product character.
Close product character.
Print the largest factor on the right.
Exclude Trivial Factor
The input integer 20160 in this example, although not very large, has mighty powers. It has 84 divisors that can be combined into products to produce itself in 1260 ways (1261 ways including the trivial product 20160 × 1). Not to clutter the output with so many products, we limited the output length to just 50 products. We also disabled the option that uses the trivial divisor "1" and chose the display order to be descending (largest multipliers go first). To customize the output, we replaced the regular multiplication sign with the mid-line dot operator, put products in quoted square brackets, and separated them with the comma character.
20160
"[10080⋅2]", "[6720⋅3]", "[5040⋅4]", "[4032⋅5]", "[3360⋅6]", "[2880⋅7]", "[2520⋅8]", "[2240⋅9]", "[2016⋅10]", "[1680⋅12]", "[1440⋅14]", "[1344⋅15]", "[1260⋅16]", "[1120⋅18]", "[1008⋅20]", "[960⋅21]", "[840⋅24]", "[720⋅28]", "[672⋅30]", "[630⋅32]", "[576⋅35]", "[560⋅36]", "[504⋅40]", "[480⋅42]", "[448⋅45]", "[420⋅48]", "[360⋅56]", "[336⋅60]", "[320⋅63]", "[315⋅64]", "[288⋅70]", "[280⋅72]", "[252⋅80]", "[240⋅84]", "[224⋅90]", "[210⋅96]", "[192⋅105]", "[180⋅112]", "[168⋅120]", "[160⋅126]", "[144⋅140]", "[5040⋅2⋅2]", "[3360⋅3⋅2]", "[2520⋅4⋅2]", "[2016⋅5⋅2]", "[1680⋅6⋅2]", "[1440⋅7⋅2]", "[1260⋅8⋅2]", "[1120⋅9⋅2]", "[1008⋅10⋅2]"
Required options
These options will be used automatically if you select this example.
How many integer products to find?
Allow using the trivial factor "1" in integer products?
Enter the symbol you want to use as the multiplication symbol.
Insert this symbol between products. (Newline by default).
Open product character.
Close product character.
Print the largest factor on the left.
Random Factor Order
This example rewrites integer 608 as a product in twelve ways (there are 19 ways in total). It mixes the order of multipliers in products and includes the factor "1" in expressions. It uses the asterisk character as the multiplication symbol and the parentheses "(" and ")" as open and close product symbols. One integer product is printed per line and the factors are shuffled in a different order each time you click on the example.
608
(608 ∗ 1) (19 ∗ 32 ∗ 1) (16 ∗ 1 ∗ 38) (2 ∗ 1 ∗ 304) (1 ∗ 152 ∗ 4) (76 ∗ 8 ∗ 1) (16 ∗ 19 ∗ 1 ∗ 2) (1 ∗ 2 ∗ 76 ∗ 4) (1 ∗ 2 ∗ 38 ∗ 8) (2 ∗ 1 ∗ 2 ∗ 152) (19 ∗ 8 ∗ 4 ∗ 1) (38 ∗ 1 ∗ 4 ∗ 4) (2 ∗ 4 ∗ 4 ∗ 1 ∗ 19)
Required options
These options will be used automatically if you select this example.
How many integer products to find?
Allow using the trivial factor "1" in integer products?
Enter the symbol you want to use as the multiplication symbol.
Insert this symbol between products. (Newline by default).
Open product character.
Close product character.
Print integer factors in mixed order.
Pro tips Master online integer tools
You can pass input to this tool via ?input query argument and it will automatically compute output. Here's how to type it in your browser's address bar. Click to try!
https://onlineintegertools.com/rewrite-integer-as-product?input=100&number-of-products=9&include-one=true&multiply-symbol=%20%C3%97%20&product-separator=%5Cn&open-symbol=&close-symbol=&left-to-right=true
All integer tools
Didn't find the tool you were looking for? Let us know what tool we are missing and we'll build it!
Quickly rewrite integer digits using pretty Unicode glyphs.
Quickly generate random two-dimensional integer points.
Quickly generate random three-dimensional integer points.
Quickly print a list of integers that are palindromes.
Quickly convert the given integer to a palindromic integer.
Quickly find all integers in the given text or string.
Quickly make integer digits go in a triangle wave.
Quickly unleash the destructive force of Zalgo on integers.
Quickly find two or more integers that add up to the given integer.
Quickly find several integers that multiply up to the given integer.
Quickly randomize the given sequence of integers.
Quickly mix the order of digits in an integer.
Quickly put integers in increasing or decreasing order.
Quickly sort the individual digits of an integer.
Quickly increase all integers by a certain amount.
Quickly increase individual digits by a certain amount.
Quickly decrease all integers by a certain amount.
Quickly decrease individual digits by a certain amount.
Quickly randomly select an integer from a list of integers.
Quickly create groups from the digits of an integer.
Quickly write integer digits backwards.
Quickly remove one or more digits from an integer.
Quickly replace one or more digits in an integer.
Quickly drop digits from an integer and make it shorter.
Quickly add the thousands separator to integers.
Quickly remove the thousands separator from integers.
Quickly find the largest integer in a list of integers.
Quickly find the smallest integer in a list of integers.
Quickly find the total sum of a bunch of integers.
Quickly find the sum of all the digits in an integer.
Quickly find the total product of a bunch of integers.
Quickly find the product of all the digits in an integer.
Quickly calculate the partial sum of a bunch of integers.
Quickly calculate the partial product of a bunch of integers.
Quickly flip the sign of one or more integers.
Quickly split an integer into chunks of a given length.
Quickly merge partial integers together to form a larger integer.
Quickly round integers up or down to the required precision.
Quickly convert integers to a downloadable picture.
Quickly generate a list of von Neumann ordinals.
Quickly generate a list of Zermelo ordinals.
Quickly generate an ordered sequence of integers.
Quickly generate an ordered list of even integers.
Quickly generate an ordered list of odd integers.
Quickly write an integer spelling in words.
Quickly convert spelled integers to regular integers with digits.
Quickly generate an array of integers for programming.
Quickly find the number of occurrences of digits in integers.
Coming soon These integer tools are on the way
Draw von Neumann Universe
Create a drawing that visualizes von Neumann hierarchy of sets.
Create Integer n-Tuples
Generate a list of tuples of integers with n elements.
Convert Integers to Unary Base
Quickly convert integers to base one.
Convert Unary Base to Integers
Quickly convert base one to integers.
Convert Integers to Binary Base
Quickly convert integers to base two.
Convert Binary Base to Integers
Quickly convert base two to integers.
Convert Integers to Octal Base
Quickly convert integers to base eight.
Convert Octal Base to Integers
Quickly convert base eight to integers.
Convert Integers to Hex Base
Quickly convert integers to base sixteen.
Convert Hex Base to Integers
Quickly convert base sixteen to integers.
Convert Integers to Any Base
Quickly convert integers to a custom base.
Convert Integers to Base64
Quickly encode integers to base-64.
Convert Base64 to Integers
Quickly decode base-64 to integers.
Convert Integers to HTML Entities
Quickly encode integers to HTML encoding.
Convert HTML Entities to Integers
Quickly decode HTML entities to integers.
Create Random Integers
Generate a list of random integers.
Check if an Integer is Symmetric
Check if the given integers are palindromes.
Generate an Integer Matrix
Create a matrix whose entries are all integers.
Generate an Integer Vector
Create a vector with integer coefficients.
Rotate Integers
Rotate the digits of an integer to the left or right.
Shift Integer Digits
Move the digits of an integer to the left or right.
Subtract Integers
Quickly find the difference of a bunch of integers.
AND Integers
Quickly apply the bitwise AND operation to integers.
OR Integers
Quickly apply the bitwise OR operation to integers.
XOR Integers
Quickly apply the bitwise XOR operation to integers.
NOT Integers
Quickly apply the bitwise NOT operation to integers.
NAND Integers
Quickly apply the bitwise NAND operation to integers.
NOR Integers
Quickly apply the bitwise NOR operation to integers.
XNOR Integers
Quickly apply the bitwise NXOR operation to integers.
Convert an Integer to Ordinal
Add -st, -nd, -rd, -th suffixes to integers to make them ordinals.
Convert an Oridinal to Integer
Remove -st, -nd, -rd, -th suffixes from ordinals to make them ints.
Filter Integers
Find integers that match a filter (greater, less, equal).
Left-pad Integers
Add padding to integers on the left side.
Right-pad Integers
Add padding to integers on the right side.
Right-align Integers
Position all integers so that they align on the right.
Center Integers
Position all integers so that they align in the middle.
Take Absolute Value of Integers
Turn all integers into positive integers.
Make All Integers Negative
Turn all integers into negative integers.
Convert Integers to Fractions
Rewrite an integer in fractional form.
Convert Fractions to Integers
Extract the numerator and denominator from a fraction.
Find and Replace Integers
Search for all occurrences of an integer and replace it.
Generate Integers from Regex
Create integers that match the given regular expression.