This online utility generates a sequence of symmetric integers and prints them in the output. It can find all palindromic integers in the given range or calculate a certain number of them starting from a specific value. You can also customize the palindrome sequence by adjusting the integer separator and decorator symbols that wrap the integers. Created by math nerds from team Browserling.
This online utility generates a sequence of symmetric integers and prints them in the output. It can find all palindromic integers in the given range or calculate a certain number of them starting from a specific value. You can also customize the palindrome sequence by adjusting the integer separator and decorator symbols that wrap the integers. Created by math nerds from team Browserling.
With this browser-based program, you can print a list of integer palindromes, also known as symmetric integers. An integer is symmetric if its digits are mirrored on the right and left sides relative to the middle point. A palindromic integer can be read both from the beginning and from the end and you will get the same value. There are infinitely many palindrome integers, starting from single-digit integers, for example, "0" and "6", two-digit integers, for example, "22" and "99", three-digit "121" and "555", ten-digit "1234554321", and more. This application has two modes of operation. The first mode computes all symmetric integers in any interval. The second mode computes the specified number of consecutive symmetric integers starting from a specific integer. You can switch between these two generator modes in the options and use the start-range, end-range, start-position, and count fields below the mode switches to set the needed parameters. You can create custom integer palindrome sequences by wrapping all values in brackets, quotes, or other characters. For example, you can create a JavaScript array of integer palindromes by setting the sequence start and end characters to "[" and "]", which will produce "[2992, 3003, 3113]" or a Perl list "(767, 777, 787)". You can also wrap individual elements in quotation marks and create a list of strings '444', '454', '464' and change the separator symbol that goes between all elements. Integerabulous!
With this browser-based program, you can print a list of integer palindromes, also known as symmetric integers. An integer is symmetric if its digits are mirrored on the right and left sides relative to the middle point. A palindromic integer can be read both from the beginning and from the end and you will get the same value. There are infinitely many palindrome integers, starting from single-digit integers, for example, "0" and "6", two-digit integers, for example, "22" and "99", three-digit "121" and "555", ten-digit "1234554321", and more. This application has two modes of operation. The first mode computes all symmetric integers in any interval. The second mode computes the specified number of consecutive symmetric integers starting from a specific integer. You can switch between these two generator modes in the options and use the start-range, end-range, start-position, and count fields below the mode switches to set the needed parameters. You can create custom integer palindrome sequences by wrapping all values in brackets, quotes, or other characters. For example, you can create a JavaScript array of integer palindromes by setting the sequence start and end characters to "[" and "]", which will produce "[2992, 3003, 3113]" or a Perl list "(767, 777, 787)". You can also wrap individual elements in quotation marks and create a list of strings '444', '454', '464' and change the separator symbol that goes between all elements. Integerabulous!
In this example, we extract all symmetric integers from the range 0 to 1000 and print them separated by spaces. It turns out that there are 109 palindromes among the first one thousand integers. The integers from 0 to 9 are palindromic as they consist of a single digit. Values from 11 to 99 have mirror symmetry as both digits are duplicates. And integers from 101 to 999 have central symmetry as the digit in the center is not duplicated but the other two digits around it are duplicated.
This example generates thirty comma-separated palindromes starting from the ten-thousandth position. It uses custom formatting and wraps each symmetric integer in guillemets marks and the entire sequence in curly brackets. Each palindrome consists of an odd number of digits, therefore the central digit is unique but the two side digits are reflected.
In this example, we specify a large starting value equal to five billion and calculate ten symmetric values that follow it. We place each palindrome on a new line by using the "\n" character in the palindrome separator option. We also add the right-arrow and left-arrow glyphs before and after each value, hinting that the palindromes can be read from any direction.
You can pass options to this tool using their codes as query arguments and it will automatically compute output. To get the code of an option, just hover over its icon. 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!
