Perfect numbers, Wieferich primes and the solutions of $\binom{2n}{n}\equiv 2^n \bmod n$

Abstract: In this article we focus on the solutions of a congruence equation: $\binom{2n}{n}\equiv 2ⁿ \bmod n$. Using the main result of this article and the SageMath software, we improve largely the number of known solutions. Furthermore, we prove that some famous numbers like even perfect numbers and Wieferich primes are connected to solutions of this equation.