Cody

Problem 2008. Number Persistence

Created by Zikobrelli in Community

A number's persistence is the number of steps required to reduce it to a single digit by multiplying all its digits to obtain a second number, then multiplying all the digits of that number to obtain a third number, and so on until a one-digit number is obtained.

For example, 66 has a persistence of three because it requires three steps to reduce it to one digit: 66-36-18-8.

Solution Stats

74.71% Correct | 25.29% Incorrect
Last solution submitted on Mar 03, 2019

Problem Comments

Solution Comments