Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Perhap this remark at inhttps://math.stackexchange.com/questions/412980/kx-1-x-2-dots-is-a-ufd might be useful: Paul Cohn introduced the idea of inert extensions when studying Bezout rings. Cohn proved that every gcd domain can be inertly embedded in a Bezout domain, and every UFD can be inertly embedded in a PID.
Just to note that such numbers are 5-smooth or regular numbers. See smooth numbers and regular numbers in Wikipedia A formula for the number of such numbers less than n is given in the second link.