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, puzzles and problems to solve every day! You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

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.

Answers to Questions

How to calculate a digital root?

Digital root calculation uses recursive reduction that consists in repeating the operation of 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, for example from a date of birth:

dCode retains ownership of the source code of the script Digital Root online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be given for free. So if you need to download the online Digital Root script for offline use, check contact page !