Smith no. Program in python

Question

A Smith number is a composite number for which, in a given base (in base 10 by default), the sum of its digits is equal to the sum of the digits in its prime factorization.[1] For example, 378 = 2 × 3 × 3 × 3 × 7 is a Smith number since 3 + 7 + 8 = 2 + 3 + 3 + 3 + 7. In this definition the factors are treated as digits: for example, 22 factors to 2 × 11 and yields three digits: 2, 1, 1. Therefore 22 is a Smith number because 2 + 2 = 2 + 1 + 1.

The first few Smith numbers are:

4, 22, 27, 58, 85, 94, 121, 1

Answer 1

This is interesting information, but it's not really a question.

Answer 2

There's this thing called Google, it's a handy tool when you need something. I found this: https://www.tannr.com/2013/01/12/detecting-smith-numbers/

I suggest, kindly, that you do some research before you ask a question. Saves all of us time, y'know?

Answer 3

I want a program which checks wether a no. is Smith no. or not.