〜 ★ dCode presents ★ 〜

Digital Root

Results
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.

Digital Root Calculator









Answers to Questions

How to calculate a digital root?

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.)

Example: 25/12/2000 => 2 + 5 + 1 + 2 + 2 + 0 + 0 + 0 = 12 => 1 + 2 = 3

How to calculate a digital root for a name?

It is possible to assign a value to a name using the position of letters in the alphabet (see A1Z26 code where A = 1, B = 2, ... Z = 26) then make the desired additions and analyze the total.

Example: DCODE = 4,3,15,4,5 and 4+3+15+4+5 = 31 => 3+1 = 4
(variant) DCODE = 4,3,15,4,5 and 4+3+1+5+4+5 = 22 => 2+2 = 4

Source code

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. To download the online Digital Root script for offline use on PC, iPhone or Android, ask for price quote on contact page !

Questions / Comments


Team dCode likes feedback and relevant comments; to get an answer give an email (not published). It is thanks to you that dCode has the best Digital Root tool. Thank you.

Source : https://www.dcode.fr/recursive-reduction
Feedback