Problem 83. Prime factor digits

Consider the following number system. Calculate the prime factorization for each number n, then represent the prime factors in a vector like so:

Each "place" in the number system represents a prime number. Given n, return the vector p.

As shown above, if n = 26, then p = [1 0 0 0 0 1].

The input n is always an integer greater than 1. Suppress any leading zeros. The length of the vector is determined by the largest prime factor.