In a posthumously published work, Euler proved that all even
perfect numbers are of the form
![$2^{p-1}(2^p-1)$](img3.svg)
, where
![$2^p-1$](img4.svg)
is
a prime number. In this article, we extend Euler's method for certain
![$\alpha$](img2.svg)
-perfect numbers for which Euler's result can be generalized. In
particular, we use Euler's method to prove that if
![$N$](img5.svg)
is a
![$3$](img6.svg)
-perfect
number divisible by
![$6$](img7.svg)
; then either
![$2\parallel N$](img8.svg)
or
![$3\parallel
N$](img9.svg)
. As well, we prove that if
![$N$](img5.svg)
is a
![$\frac{5}{2}$](img10.svg)
-perfect number
divisible by
![$5$](img11.svg)
, then
![$2^4\parallel N$](img12.svg)
,
![$5^2\parallel N$](img13.svg)
, and
![$31^2\mid
N$](img14.svg)
. Finally, for
![$p\in\{17,257,65537\}$](img15.svg)
, we prove that there are no
![$\frac{2p}{p-1}$](img16.svg)
-perfect numbers divisible by
![$p$](img17.svg)
.