How to code for prime factorization of a number?

#1

how can we get repeated prime factors.For example:8 is 222.So,how can we get 3 times 2 and add them to test for boston numbers?

#2

hi @divyanshinegi2003_987b3f0f92dd8c0c,
here u need to find the number whose sum of digits are equal to sum of digits of its factor except 1

check here for implementation ive commented the code : https://ide.codingblocks.com/s/656874

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.