With this browser-based program, you can add visual separators between every n digits of an integer. By default, every three digits get separated by a comma but you can change the separator symbol that goes between the digits. The separators get added from the low end of the integer but you can also make it work the other way from the high end. Created by math nerds from team Browserling.
With this browser-based program, you can add visual separators between every n digits of an integer. By default, every three digits get separated by a comma but you can change the separator symbol that goes between the digits. The separators get added from the low end of the integer but you can also make it work the other way from the high end. Created by math nerds from team Browserling.
This online utility lets you insert delimiter characters between a certain number of integer digits. For example, if you have an integer 1234567, then to make it easier to read, you can insert an apostrophe between every 3 digits and get 1'234'567. The character that gets inserted between the digits can be changed in the options. The most common thousands separator characters are a comma (1,234,567), a dot (1.234.567), and a space (1 234 567). In these examples, the digits are counted from the end. You can also count the digits from the start. In this case, you will get 123'456'7. A common trick to memorize large integers (such as the fractional part of the constant π) is to separate every 5 digits or 6 digits. The fractional part of π is 1415926535897932384626433 and if you change the digit count (in the options) to 5, you will get 14159 26535 89793 23846 26433 in the output, which is now very easy to memorize. Integerabulous!
This online utility lets you insert delimiter characters between a certain number of integer digits. For example, if you have an integer 1234567, then to make it easier to read, you can insert an apostrophe between every 3 digits and get 1'234'567. The character that gets inserted between the digits can be changed in the options. The most common thousands separator characters are a comma (1,234,567), a dot (1.234.567), and a space (1 234 567). In these examples, the digits are counted from the end. You can also count the digits from the start. In this case, you will get 123'456'7. A common trick to memorize large integers (such as the fractional part of the constant π) is to separate every 5 digits or 6 digits. The fractional part of π is 1415926535897932384626433 and if you change the digit count (in the options) to 5, you will get 14159 26535 89793 23846 26433 in the output, which is now very easy to memorize. Integerabulous!
In this example, we insert commas in a large integer between every three powers of ten, starting from ones. The ones, tens, and hundreds get separated by a comma, then thousands, ten thousands, and hundred thousands get separated by a comma, and so on. The new value with commas creates an easy-to-read version of the integer that lets you estimate its order via subitizing. It's now easy to see that the value is about 5 trillion as there are four commas with three digits between them, so the order is 104×3 = 1012, which is trillions.
In this example, we convert a list of the first eight perfect integers into a new representation that lets us easily memorize them. Just as a reminder, a perfect integer is one whose sum of all its divisors is equal to the integer itself. There are just a few perfect values and they grow very fast. The first four are easy to memorize as they have four digits or less but the larger values are hard to memorize as there are so many digits. The new representation inserts a middle dot character between every four digits, breaking them into smaller sets that can now be individually memorized.
In this example, we separate individual integer digits and place each digit on a new line. To accomplish it, we set the digit counter equal to "1" and the separator character equal to "\n" in the options. This way, every digit gets separated by a new line character, which flips the eight-digit integer from the horizontal position to vertical.
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!
Create a drawing that visualizes von Neumann hierarchy of sets.
Create a sudoku puzzle.
Create a list of neat-looking integers (called magic integers).
Generate a list of tuples of integers with n elements.
Quickly convert integers to base one.
Quickly convert base one to integers.
Quickly convert integers to base two.
Quickly convert base two to integers.
Quickly convert integers to base eight.
Quickly convert base eight to integers.
Quickly convert integers to base sixteen.
Quickly convert base sixteen to integers.
Quickly encode integers to base-64.
Quickly decode base-64 to integers.
Quickly convert integers to a custom base.
Quickly encode integers to HTML encoding.
Quickly decode HTML entities to integers.
Quickly encode integers to URL (percent) encoding.
Quickly decode URL-encoded integers.
Quickly convert a signed integer to an unsigned integer.
Quickly convert an unsigned integer to a signed integer.
Generate a list of random integers.
Check if the given integers are palindromes.
Create a matrix whose entries are all integers.
Create a vector with integer coefficients.
Quickly calculate the average value of integers.
Quickly calculate the average value of integer digits.
Quickly randomly select a digit from an integer.
Find which of the given integers is the biggest or smallest.
Limit integer values to a range.
Limit integer digit values to a range.
Create multiple copies of the input integers.
Create multiple copies of digits of input integers.
Rotate the digits of an integer to the left or right.
Move the digits of an integer to the left or right.
Quickly find the difference of a bunch of integers.
Quickly apply the bitwise AND operation to integers.
Quickly apply the bitwise OR operation to integers.
Quickly apply the bitwise XOR operation to integers.
Quickly apply the bitwise NOT operation to integers.
Quickly apply the bitwise NAND operation to integers.
Quickly apply the bitwise NOR operation to integers.
Quickly apply the bitwise NXOR operation to integers.
Quickly divide two or more integers.
Quickly divide the digits of an integer.
Add -st, -nd, -rd, -th suffixes to integers to make them ordinals.
Remove -st, -nd, -rd, -th suffixes from ordinals to make them ints.
Find integers that match a filter (greater, less, equal).
Add padding to integers on the left side.
Add padding to integers on the right side.
Position all integers so that they align on the right.
Position all integers so that they align in the middle.
Turn all integers into positive integers.
Turn all integers into negative integers.
Rewrite an integer in fractional form.
Extract the numerator and denominator from a fraction.
Search for all occurrences of an integer and replace it.
Create a regex that matches the given integers.
Create integers that match the given regular expression.
Create relatively tiny integers.
Create relatively huge integers.
Create a sequence of oscillating integers, such as 123212321.
Create multiple integer sequences at once.
Slightly change an integer so it has an error.
Slightly change integer digits so there are errors.
Apply fuzzing to integers and add perturbations.
Apply fuzzing to integer digits and add digit perturbations.
Add highlighting to certain integers.
Add highlighting to certain integer digits.
Add color to integers based on a condition.
Add color to individual digits in the given integers.
Quickly assign colors to integers and draw them as pixels.
Quickly assign integer values to pixel colors and print them.
Make the digits of an integer go in a spiral shape.
Make the digits of an integer go in a circle.
Make the digits of an integer go in a diamond shape.
Fill a box with certain width and height with digits.
Use ASCII art to convert integers to 2-dimensional drawings.
Use ASCII art to convert integers to 3-dimensional drawings.
Decompose an integer into ones, tens, hundreds, etc.
Generate an ordered list of increasing integers.
Generate an ordered list of decreasing integers.
Quickly find various information about the given integers.
Find hidden patterns of numbers in integers.
Find the Shannon entropy of an integer.
Subscribe to our updates. We'll let you know when we release new tools, features, and organize online workshops.
Enter your email here
We're Browserling — a friendly and fun cross-browser testing company powered by alien technology. At Browserling our mission is to make people's lives easier, so we created this collection of integer tools. Our tools have the simplest user interface that doesn't require advanced computer skills and they are used by millions of people every month. Our integer tools are actually powered by our programming tools that we created over the last couple of years. Check them out!
