Type letters or a list of items to see every possible order they can be arranged in. Choose k to arrange only some of them, or allow repeats to build codes like 000 to 444, then copy the list or download it as CSV.
Last updated:
Type a word to arrange its letters, or separate items with commas, spaces or new lines
Leave empty to arrange all items
Up to 20,000 rows; the count is always exact
Enter your values to see the result.
Advertisement
Advertisement
How to use the Permutations Generator
Type a word or a list. A single word is split into letters; commas, spaces or new lines separate whole items.
Leave k empty to arrange all items, or enter a number to arrange only k of them.
Tick Allow repetition if every position may use any item again, as with digits in a code.
Press Generate to see the exact count, the formula and the list of permutations.
Copy or export the list with Copy results (one per line) or Download CSV.
Permutation formulas
Situation
Formula
Example
Count
Arrange all n different items
n!
ABCD
4! = 24
Arrange k of n different items
n! ÷ (n − k)!
3 of 5 runners on a podium
5 × 4 × 3 = 60
Items may repeat in every position
nk
3-digit codes from 0–4
5³ = 125
All items, some identical
n! ÷ (a! × b! × …)
BANANA (A×3, N×2)
720 ÷ 12 = 60
k items, some identical
coefficient of xk/k! in ∏(1 + x + … + xc/c!)
3 letters of BANANA
19
The factorial n! = n × (n − 1) × … × 2 × 1 counts the orders because the first position has n choices, the second n − 1, and so on. Stopping after k positions gives n! ÷ (n − k)!.
How quickly n! grows
Items
Permutations
Listed by this tool
3
6
all
5
120
all
7
5,040
all (raise the maximum)
8
40,320
first 20,000
10
3,628,800
first 20,000
15
1,307,674,368,000
first 20,000
Tips
Word games: use "Each character" splitting so a word is treated as letters, then compare the list with a dictionary or an anagram solver.
Schedules and seating: put one name per line and choose "A, B, C" output to read each arrangement clearly.
Too many results? Lower k, remove items, or fix the first position yourself and generate the rest.
Order does not matter? Then you want combinations, which are far fewer: use the Combinations Generator.
Frequently asked questions
How many permutations does a word have?
If all letters are different, a word with n letters has n! permutations: ABCD has 4! = 24. If some letters repeat, divide by the factorial of each repeat count. BOOK has 4! ÷ 2! = 12 distinct arrangements and BANANA has 6! ÷ (3! × 2!) = 60.
What is a k-permutation?
It is an ordered arrangement of k items chosen from n, such as the gold, silver and bronze finishers among 5 runners. The count is P(n, k) = n! ÷ (n − k)!, so 5 runners give 5 × 4 × 3 = 60 possible podiums.
What are permutations with repetition?
Each position can use any of the n items again, so there are n^k arrangements. Three-digit codes from the digits 0 to 4 give 5³ = 125 possibilities, from 000 to 444.
Why is the list limited to 20,000 rows?
Permutations grow faster than almost anything: 10 items have 3,628,800 orders and 13 items have over 6 billion. The generator always shows the exact count, but lists at most 20,000 so your browser stays responsive. Use k or fewer items for a full list.
What order are permutations listed in?
In lexicographic order of the positions you typed the items in. For ABC that is ABC, ACB, BAC, BCA, CAB, CBA, which is alphabetical when the input is alphabetical.
Is a permutations generator the same as an anagram solver?
Not quite. This tool lists every arrangement of the letters, whether or not it is a real word. An anagram solver filters those arrangements against a dictionary to show only real words.
Is my input uploaded?
No. The permutations are generated in your browser with JavaScript, and nothing you type leaves your device.
Are all the tools on FreeToolCabin tested for quality and accuracy?
Yes! Every tool on our site undergoes automated Q/A testing in real browser environments to ensure high precision, correct output, and zero errors. If you happen to spot a bug or have a suggestion, please contact us at [email protected] and our team will review it right away.