Discrete math Kuratowski's theorem question

Let G be the graph Whose vertex set is all the positive integer divisors of the number 2 - 3- 5 - 7 = 210 (so, 0 has 16 vertices, as there are 16 such divisors). We let the edges of this graph consist of all {(1, b} Where a divides b or b divides a. For example {6, 30} would be an edge, since 6 divides 30; but, {2, 3} would not be an edge, since 2 doesn't divide 3 and 3 doesn't divide 2. Use Kuratowski's Theorem to prove that this graph is not planar