Print the missing primes The Task

Write a program or function that, when passed a numerical input x, prints or returns the primes beneath the square root of x1 that are not factors of x.

Examples

Let f(x) be the function called:

&gt;&gt;&gt; f(4)
[]

&gt;&gt;&gt; f(5)
[2]

&gt;&gt;&gt; f(20)
[3]

&gt;&gt;&gt; f(60)
[7]

&gt;&gt;&gt; f(100)
[3, 7]

&gt;&gt;&gt; f(10000)
[3, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]


Bonus Rules


You may use any builtins that your language provides.
Your program must support an x input as high as the upper bound defined by your language.




1 Using the square root as only primes below the square root can actually be involved within the factors of x. Without making this restriction, larger numbers would have a lot of excess printed numbers.
Jelly, 6 bytes in Jelly's codepage

½ÆRḟÆf


Try it online!

Explanation:

½ÆRḟÆf
 ÆR    All primes less than or equal to
½      the square root of the input
   ḟ   but with the following removed:
    Æf All prime factors of {the input, by default}