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 online "Digital Root" source code. Except explicit open source licence (indicated CC / 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, copy-paste, or API access for "Digital Root" are not public, same for offline use on PC, tablet, iPhone or Android ! Remainder : dCode is free to use.

Need Help ?

Please, check our dCode Discord community for help requests! NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Thanks to your feedback and relevant comments, dCode has developed the best 'Digital Root' tool, so feel free to write! Thank you!

Thanks to your feedback and relevant comments, dCode has developed the best 'Digital Root' tool, so feel free to write! Thank you!