We show that there is some absolute constant c > 0, such that for any union-closed family F ⊆ 2 [n] , if |F| ≥ ( 1 2 − c)2 n , then there is some element i ∈ [n] that appears in at least half of the sets of F. We also show that for any union-closed family F ⊆ 2 [n] , the number of sets which are not in F that cover a set in F is at most 2 n−1 , and provide examples where the inequality is tight.