This paper introduces an approach for creating tilings made by the iterative fragmentation of polygons according to the prime factors of any integer greater than 1 (n), thus attempting to link the properties of n to a tessellation made of n tiles. Choosing n as the power of a base integer, the method produces non-hyperbolic bounded fractal tilings, rich in visual complexity. In addition, the paper presents a colouring method, which iteratively applies the prime factorization fractal approach to the luminosity dimension, thus synchronising colour and geometry along the iterative tiling process.