Given a binary number as input through any means, "simplify" the number using a full program or a function.
binaryis a number in binary that is over 0.
Take the input, convert it to base 10 without using a builtin, then if that number contains only 1s and 0s, convert it into a base 10 number as if it were another binary number. Repeat the process until the number cannot be read in binary and output that number.
If the input is 1, simply output
1. Your program should not go on infinitely simplifying 1.
This is code golf, so shortest answer in bytes by Tuesday (November 17th) wins.
If anything is confusing, leave a comment specifying what I need to clear up and I will edit it accordingly.
Builtins for base conversion are not allowed.
Input | Output 1 | 1 1010 | 2 1011 | 3 1100100 | 4 1100101 | 5 1111110011 | 3