Skip to main content

Dudeney Number

Dudeney number is a positive integer that is equal to the cube of the sum of all its digits.

Checking a Dudeney Number

Step 1: Consider any number.

Step 2: Sum all its digits.

Step 3: Cube the number obtained in Step 2.

If the number obtained in Step 3 is equal to the number considered in Step 1, it is a Dudeney number. But if the number obtained in Step 3 is not equal to the number considered in Step 1, it is not a Dudeney number.

Examples

Example 1

Step 1: Consider number 0.

Step 2: Sum all its digits. The resultant is 0.

Step 3: Cube the number 0 obtained in Step 2 => 03 => 0 x 0 x 0. The resultant is 0.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 0 is a Dudeney number.

Example 2

Step 1: Consider number 1.

Step 2: Sum all its digits. The resultant is 1.

Step 3: Cube the number 1 obtained in Step 2 => 13 => 1 x 1 x 1. The resultant is 1.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 1 is a Dudeney number.

Example 3

Step 1: Consider number 512.

Step 2: Sum all its digits (5 + 1 + 2). The resultant is 8.

Step 3: Cube the number 8 obtained in Step 2 => 83 => 8 x 8 x 8. The resultant is 512.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 512 is a Dudeney number.

Example 4

Step 1: Consider number 4913.

Step 2: Sum all its digits (4 + 9 + 1 + 3). The resultant is 17.

Step 3: Cube the number 17 obtained in Step 2 => 173 => 17 x 17 x 17. The resultant is 4913.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 4913 is a Dudeney number.

Example 5

Step 1: Consider number 5832.

Step 2: Sum all its digits (5 + 8 + 3 + 2). The resultant is 18.

Step 3: Cube the number 18 obtained in Step 2 => 183 => 18 x 18 x 18. The resultant is 5832.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 5832 is a Dudeney number.

Example 6

Step 1: Consider number 17576.

Step 2: Sum all its digits (1 + 7 + 5 + 7 + 6). The resultant is 26.

Step 3: Cube the number 26 obtained in Step 2 => 263 => 26 x 26 x 26. The resultant is 17576.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 17576 is a Dudeney number.

Example 7

Step 1: Consider number 19683.

Step 2: Sum all its digits (1 + 9 + 6 + 8 + 3). The resultant is 27.

Step 3: Cube the number 27 obtained in Step 2 => 273 => 27 x 27 x 27. The resultant is 19683.

The number obtained in Step 3 is equal to the number considered in Step 1, hence 19683 is a Dudeney number.

After considering the above examples, it is clear that the possible Dudeney numbers are: 0, 1, 512, 4913, 5832, 17576, and 19683.

Hope you liked this amazing concept of the Dudeney number. In case of any query, please feel free to provide your valuable comments.
Labels:

Comments

Post a Comment

Popular posts from this blog

The 3n + 1 Problem or Collatz Problem

The 3n + 1 Problem, also known as the 3n + 1 Conjecture or Collatz Problem or Collatz Conjecture, is that if any positive integer  n  is iteratively operated using two simple rules:  Addition  and  Division , then the end-result always leads to the number 1. The Rules Rule 1 [Addition]:  If the number n is odd, then triple it and add 1. Rule 2 [Division]:  If the number n is even, then divide it by 2. Steps to Follow Step 1:  Take any positive integer n. Step 2:  Check whether the integer is odd or even. Step 3:  If the integer is odd, then triple it and add 1. Step 4:  If the integer is even, then divide it by 2. Step 5:  Repeat this procedure. Step 6:  The end-result always leads to the number 1. For Example Integer n = 5 5 is an odd number, so triple it and add 1. The value of n = 16. 16 is an even number, so divide it by 2. The value of n = 8. 8 is an even number, so divide it by 2. The va...
2 comments
Read more

Kaprekar Constant 6174 for Four-digit Number

Dattatreya Ramchandra Kaprekar (D. R. Kaprekar; 1905 – 1986) was an Indian mathematician who discovered several classes of natural numbers including Kaprekar Constant. The number 6174 is called Kaprekar Constant for four-digit number. Why is the number 6174 called Kaprekar Constant? In 1949, D. R. Kaprekar discovered an interesting property of the number 6174 through the mathematical calculations. D. R. Kaprekar observed that when any four-digit number of non-identical digits (not all digits are same) is arranged in two parts – highest number and lowest number, and difference is calculated using subtraction method, then the end-result will be always 6174 either in the first step or in no more than 7 steps. If the process is continued even after getting the end-result 6174, then the end-result will be always 6174 at each Iteration, therefore the number 6174 is known as Kaprekar Constant. Steps to Follow Take any four-digit number with different digits. Form the highest nu...
Post a Comment
Read more

The Number 1.6: Base of Fibonacci Sequence and the Golden Ratio

This post is about the number 1.6 that forms the base of the mathematical concepts Fibonacci sequence and the Golden ratio. For better understanding of this amazing number 1.6, it is important to know about Fibonacci sequence and the Golden ratio. Golden Ratio The  Golden ratio is the ratio of a line segment cut into two pieces of distinct lengths such that the ratio of the longer segment to the shorter segment is equal to the whole segment to that of the longer segment. It is denoted by the symbol Phi [ø]. Suppose there is a line segment AB, and C is any point that divides the line segment AB into two pieces of distinct lengths such that AC is greater than CB. Then, as per the definition, [ø] = AC/CB = AB/AC. The value of the Golden ratio [ø] is 1.6 1803398875 . As you can see, the value of the Golden ratio starts with the number 1.6. For more information on the Golden ratio, see https://theamazingconcepts.blogspot.com/2021/07/the-golden-ratio-key-to-amazing-design....
Post a Comment
Read more