根据您的问题，将二进制复原数字通常指将二进制数转换为十进制数。以下是具体方法及注意事项：

一、二进制转十进制方法

整数部分

采用“按权展开求和”法，从右至左依次乘以2的幂次方并求和。例如：

$$

1010_2 = 1 times 2^3 + 0 times 2^2 + 1 times 2^1 + 0 times 2^0 = 8 + 0 + 2 + 0 = 10_{10}

$$

（对应Python代码：`int（binary_num, 2）`）

小数部分

采用“乘2取整法”，将二进制小数乘以2，整数部分为当前位，继续乘以2直到小数为0。例如：

$$

0.1_{10} = 0.000110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100110011001100