This browser-based utility adds all the digits in an integer and prints the found sum to the screen. You can find the digit sums for several integers in parallel by entering each integer on a new line. If you enable the option for iterative digit summation, then you can also find the root of the digit sum. Created by math nerds from team Browserling.
This browser-based utility adds all the digits in an integer and prints the found sum to the screen. You can find the digit sums for several integers in parallel by entering each integer on a new line. If you enable the option for iterative digit summation, then you can also find the root of the digit sum. Created by math nerds from team Browserling.
With this online tool, you can find the sum of all digits in an integer. For example, if you enter the integer 12 in the input box, you'll get 1 + 2 = 3 in the output box. Similarly, a three-digit integer 248 will produce 2 + 4 + 8 = 14. You can calculate the sum of digits of several integers at once by just writing each value on a separate line. By default, the summation algorithm simply adds all integer digits and prints the result but you can also reapply the algorithm to the found result and repeat this process recursively until a single-digit value is reached. For example, given the integer 9875, the program calculates the sum the first time: 9 + 8 + 7 + 5 = 29, then again: 2 + 9 = 11, and again: 1 + 1 = 2. Now a single-digit integer is reached, so this is the end of the algorithm. The process of recursive digit summation is also called "repeated digital sum" or "additive digital root" and it can be configured in the options. Integerabulous!
With this online tool, you can find the sum of all digits in an integer. For example, if you enter the integer 12 in the input box, you'll get 1 + 2 = 3 in the output box. Similarly, a three-digit integer 248 will produce 2 + 4 + 8 = 14. You can calculate the sum of digits of several integers at once by just writing each value on a separate line. By default, the summation algorithm simply adds all integer digits and prints the result but you can also reapply the algorithm to the found result and repeat this process recursively until a single-digit value is reached. For example, given the integer 9875, the program calculates the sum the first time: 9 + 8 + 7 + 5 = 29, then again: 2 + 9 = 11, and again: 1 + 1 = 2. Now a single-digit integer is reached, so this is the end of the algorithm. The process of recursive digit summation is also called "repeated digital sum" or "additive digital root" and it can be configured in the options. Integerabulous!
In this example, we enter several integers in a column as input and get the sum of digits for each integer in the output. The app preserves the order of input integers as well as positive and negative signs before them.
This example performs a continuous summation of the integer digits using the "Repeated Digital Sum" mode. This mode adds the digits in each integer as many times as necessary to obtain a single-digit result.
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!
