The Carmichael Numbers can be factorized in polynomial time.


Are weak fermat pseudoprimes (w.r.t. a given base) easy to factorize as well? 


What are some large/broad classes of numbers that are easy to factorize (i.e. in polynomial time). This part is pretty broad, so i would be thankful if someone can provide some examples of these classes and more importantly a few good up-to date sources, that studies/lists the classes of numbers and their factorization difficulty ? 



Classes of Numbers that are easy to factorize using Classical Computers?
Six classes of "lucky numbers", that can be factorized easily, are discussed on page 107 and following of [Integer Factoring](https://www.fdi.ucm.es/profesor/m_alonso/Documentos/factorizacion/arjlensfac.pdf) by Arjen Lenstra (2000). These include: trial division by a small prime (very effective, since 88% of all positive integers have a factor $< 100$, and almost 92% have a factor $< 1000$), Pollard's rho method and the elliptic curve method (if some random number close to some prime factor of $n$ is "smooth", in the sense that all its prime factors are small), Fermat's method (for numbers that have two large prime factors close to each other), congruence of squares (for numbers $n$ for which there exist $x$ and $y$ such that $x^2-y^2$ is a multiple of $n$).


