Tool to calculate the digital root of a number. The digital root is computed using recursive reduction that consists in performing the sum of all digits in a number and repeat this operation on the result.

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day! A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!

Digital root calculation uses recursive reduction that consists in repeating the operation of summing/adding digits until the result has only one digit.

Example: 789 => 7+8+9 = 24 => 2+4 = 6

This principle is often used in numerology to get a number from the numeric information on an individual (from a date of birth, favorite number, etc.)

dCode retains ownership of the "Digital Root" source code. Except explicit open source licence (indicated Creative Commons / free), the "Digital Root" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or the "Digital Root" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Digital Root" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.

Cite dCode

The copy-paste of the page "Digital Root" or any of its results, is allowed as long as you cite dCode!
Cite as source (bibliography): Digital Root on dCode.fr [online website], retrieved on 2022-11-29, https://www.dcode.fr/recursive-reduction