This online utility analyzes the digit frequency in one or more integers and prints the digit statistics to the screen. You can find the frequency distributions of one, two, three, or more digits, as well as check the Benford's law (first-digit law). You can display the digit count, percentage, and total values, and also choose the format of the output in the options. Created by math nerds from team Browserling.
This online utility analyzes the digit frequency in one or more integers and prints the digit statistics to the screen. You can find the frequency distributions of one, two, three, or more digits, as well as check the Benford's law (first-digit law). You can display the digit count, percentage, and total values, and also choose the format of the output in the options. Created by math nerds from team Browserling.
With this browser-based program, you can analyze the frequency of digit occurrences in one or more integers. It runs through all the digits in input integers and prints the information about the statistical digit distributions in them. For example, by entering the integer 242555 as input and analyzing single digits, you will get information that this value consists of two twos, one four, and three fives. If you adjust the "Digit Length" option to 2, then you'll get information about two-digit values: "24", "42", and "25" appear 1 time and "55" appears 2 times. Similarly, three-digit values "242", "425", "255", and "555" appear 1 time. To analyze all possible digit lengths, enter the asterisk symbol "*" in the option. You can also specify other digit length values by listing them separated by commas "1, 2, 5" (this will print statistics of single-digits, digit pairs, and five-digit values), using a range "2-4" (this will print statistics of two, three, and four-digit values), or by combining a list and a range "1-3, 5, 6" (this will print statistics of one, two, three, five and six-digit values). By default, the maximum digit length is equal to the longest integer in the input, but if you activate the option "Join All Integers", then the input will be concatenated and all the input values will form a single large integer. You can also quickly generate statistics to check the Benford's law (also know as Newcomb-Benford law or law of anomalous numbers). This law states that most often, the leading digit of statistics taken from real life is 1, while the greater digits 2, 3, … appear as the most significant digit less and less. To verify the first-digit law, enter a set of integer data in the input field and activate the "Anchor at Beginning" option. This option will look only at the first digit of each integer. By default, the program displays only the number of occurrences of digits in the integer, but you can also display the percentages and fractions of the total. You can also choose the analysis output format and display the information as full text, for example, "Digit 5 appears 3 times", via the colon character, for example, "5: 3", or using a dash, for example, "5 – 3". Integerabulous!
With this browser-based program, you can analyze the frequency of digit occurrences in one or more integers. It runs through all the digits in input integers and prints the information about the statistical digit distributions in them. For example, by entering the integer 242555 as input and analyzing single digits, you will get information that this value consists of two twos, one four, and three fives. If you adjust the "Digit Length" option to 2, then you'll get information about two-digit values: "24", "42", and "25" appear 1 time and "55" appears 2 times. Similarly, three-digit values "242", "425", "255", and "555" appear 1 time. To analyze all possible digit lengths, enter the asterisk symbol "*" in the option. You can also specify other digit length values by listing them separated by commas "1, 2, 5" (this will print statistics of single-digits, digit pairs, and five-digit values), using a range "2-4" (this will print statistics of two, three, and four-digit values), or by combining a list and a range "1-3, 5, 6" (this will print statistics of one, two, three, five and six-digit values). By default, the maximum digit length is equal to the longest integer in the input, but if you activate the option "Join All Integers", then the input will be concatenated and all the input values will form a single large integer. You can also quickly generate statistics to check the Benford's law (also know as Newcomb-Benford law or law of anomalous numbers). This law states that most often, the leading digit of statistics taken from real life is 1, while the greater digits 2, 3, … appear as the most significant digit less and less. To verify the first-digit law, enter a set of integer data in the input field and activate the "Anchor at Beginning" option. This option will look only at the first digit of each integer. By default, the program displays only the number of occurrences of digits in the integer, but you can also display the percentages and fractions of the total. You can also choose the analysis output format and display the information as full text, for example, "Digit 5 appears 3 times", via the colon character, for example, "5: 3", or using a dash, for example, "5 – 3". Integerabulous!
In this example, we analyze the frequency of occurrence of all single-digit values 0 to 9 in multiple integers. To do this, we enter the value "1" into the digit-length option, which corresponds to the analysis of individual digits. We display only the digit counts in the format "digit: number-of-occurrences". As you can see, the most popular digit is 5 and it appears 6 times.
In this example, we analyze single-digit, two-digit, three-digit, and five-digit sub-integers. To include all of these values in the analysis, we set the analysis length option to "1-3, 5". This way the analysis algorithm looks at all sub-integers of length 1 to 3 and 5. We also activate the "Join All Integers" mode to examine both input integers as one big integer. We use the dash format for the statistics output and display the frequency of the digits together with their total count.
In this example, we load country population statistics and verify Newcomb-Benford law. To find how often each leading digit appears in the sample data, we activate the "Anchor at Beginning" option. This option anchors the analysis at the first digit of each integer and discards other digits. This way, we get the frequency distribution of the first digit together with their percentage. We also select the option to print the statistical information in the text format. Looking at the output, we can say that this data follows the Benford law as the smallest leading digits appear often (digit 1 occurs in 40% of cases), while the larger digits are rarely found in the first spot (digit 9 occurs in only 8% of cases).
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!
