Factors and Multiples · Hard problem

A pattern uses $45$ tiles. Several identical copies of the pattern are placed together to form one large square array of tiles, with no tiles left over and no tiles added beyond whole copies. What is the fewest number of copies needed?