Calculate the prime factors We had a prime factorization challenge a while ago, but that challenge is nearly six years old and barely meets our current requirements, so I believe it's time for a new one.

Challenge

Write a program or function that takes as input an integer greater than 1 and outputs or returns a list of its prime factors.

Rules


Input and output may be given by any standard method and in any standard format.
Duplicate factors must be included in the output.
The output may be in any order.
The input will not be less than 2 or more than 231 - 1.
Built-ins are allowed, but including a non-builtin solution is encouraged.


Test cases

2 -&gt; 2
3 -&gt; 3
4 -&gt; 2, 2
6 -&gt; 2, 3
8 -&gt; 2, 2, 2
12 -&gt; 2, 2, 3
255 -&gt; 3, 5, 17
256 -&gt; 2, 2, 2, 2, 2, 2, 2, 2
1001 -&gt; 7, 11, 13
223092870 -&gt; 2, 3, 5, 7, 11, 13, 17, 19, 23
2147483646 -&gt; 2, 3, 3, 7, 11, 31, 151, 331
2147483647 -&gt; 2147483647


Scoring

This is code-golf, so the shortest code in bytes wins.
Pyth, 1 byte

P


I like Pyth's chances in this challenge.