This online program creates a palindromic integer from the given integer by symmetrizing its digits and prints the symmetric value in the output. You can switch between three palindrome types in the options and create a mirrored palindrome, a centered palindrome, or a minimal palindrome. Created by math nerds from team Browserling.
This online program creates a palindromic integer from the given integer by symmetrizing its digits and prints the symmetric value in the output. You can switch between three palindrome types in the options and create a mirrored palindrome, a centered palindrome, or a minimal palindrome. Created by math nerds from team Browserling.
With this browser-based utility, you can convert one or more integers into palindromes. The process of creating an integer palindrome involves adding the right digits at the end of the integer so that it forms mirror-symmetry around its middle point. There are three ways to add digits to an integer to make it palindromic. The first creates a mirror palindrome or so-called copy-reverse palindrome. This algorithm creates a copy of all integer digits, reverses them, and appends them at the end of the original integer. In this case, the size of the integer doubles as each digit on the left side will have a copy on the right side. For example, a copy-reverse palindrome of the integer 258 is 258852. The second type of palindrome is centered (also called anchored). It anchors the last digit of the integer, creates a copy of all the digits before it (that is, it copies all the digits except the last one), reverses them, and appends them at the end of the original value. In this case, all digits on the left side (except the last one) will be duplicated on the right side. An example of anchor symmetry is the value 25852 that is created from the integer 258. The last type of palindrome is minimalistic. It parses the input integer and tries to find the missing symmetry in it by copying digits from the start of the integer and appending them at the end of the integer until possible symmetry forms. For example, given the integer 1232, it's enough to copy the first digit 1 to the end of it and a symmetric value is formed 12321. Integerabulous!
With this browser-based utility, you can convert one or more integers into palindromes. The process of creating an integer palindrome involves adding the right digits at the end of the integer so that it forms mirror-symmetry around its middle point. There are three ways to add digits to an integer to make it palindromic. The first creates a mirror palindrome or so-called copy-reverse palindrome. This algorithm creates a copy of all integer digits, reverses them, and appends them at the end of the original integer. In this case, the size of the integer doubles as each digit on the left side will have a copy on the right side. For example, a copy-reverse palindrome of the integer 258 is 258852. The second type of palindrome is centered (also called anchored). It anchors the last digit of the integer, creates a copy of all the digits before it (that is, it copies all the digits except the last one), reverses them, and appends them at the end of the original value. In this case, all digits on the left side (except the last one) will be duplicated on the right side. An example of anchor symmetry is the value 25852 that is created from the integer 258. The last type of palindrome is minimalistic. It parses the input integer and tries to find the missing symmetry in it by copying digits from the start of the integer and appending them at the end of the integer until possible symmetry forms. For example, given the integer 1232, it's enough to copy the first digit 1 to the end of it and a symmetric value is formed 12321. Integerabulous!
This example converts five integers to fully-mirrored palindromes. It duplicates all digits and appends them at the end of the integer in reverse order. Mirrored palindromes always consist of an even number of digits because they double the length of each input integer.
This example activates the centered palindrome mode and creates four palindromic integers. This mode slices the integer up to the last digit, creates a reverse copy of the slice, and appends it after the last digit of the integer. This way the central digit is anchored and the length of the palindrome is always an odd value because digits to the left and right always form symmetric pairs and only the central digit doesn't have a pair.
In this example, we use the "Minimal Palidrome" option to create the shortest possible symmetric integers. In this case, the digits in the input integer are analyzed to find the shortest digital substring at the beginning of the integer that when copied to the end, creates a palindrome. For single-digit integers, this substring is empty as an integer with one digit is already palindromic (see the first integer in the input). For multi-digit integers, the substring has one or more digits but at maximum one less than the length of the integer. In the worst case, the minimal palindrome is equal to the centered palindrome.
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!
