Skip to main content

Zuckerman Number or Multiplication-Harshad Number or Multiplication-Niven Number

Zuckerman number or Multiplication-Harshad number or Multiplication-Niven number is any positive integer b that is divisible by its product of digits (POD) and all of its digits.

Zuckerman number cannot contain the digit 0. It is because if the digit 0 is present in the number, then multiplying it with other digits in the number gives the resultant 0, and no non-zero numbers are divisible by the digit 0.

As per the definition:

Zuckerman number b = number / product of digits

Below are some examples:

Number 24

Product of digits =  2 x 4 => 8

Here, number 24 is divisible by its product of digits 8, and the resultant is 3.

Apart from this, number 24 is divisible by all of its digits: 2 and 4.

Number 36

Product of digits = 3 x 6 => 18

Here, number 36 is divisible by its product of digits 18, and the resultant is 2.

Apart from this, number 36 is divisible by all of its digits: 3 and 6.

Number 115

Product of digits = 1 x 1 x 5 => 5

Here, number 115 is divisible by its product of digits 5, and the resultant is 23.

Apart from this, number 115 is divisible by all of its digits: 1, 1 and 5.

Number 175

Product of digits = 1 x 7 x 5 => 35

Here, number 175 is divisible by its product of digits 35, and the resultant is 5.

Apart from this, number 175 is divisible by all of its digits: 1, 7 and 5.

Number 224

Product of digits = 2 x 2 x 4 => 16

Here, number 224 is divisible by its product of digits 16, and the resultant is 14.

Apart from this, number 224 is divisible by all of its digits: 2, 2 and 4.

Hope you have understood the concept of Zuckerman number or Multiplication-Harshad number or Multiplication-Niven number. In case of any issue, kindly provide your valuable comments regarding the same.

Comments

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

Universe Secret Code 369 Theory

When it comes to the origin of the universe secret code 369 theory, one name associated with this amazing concept is ‘Nikola Tesla’. Nikola Tesla [10 July 1856 – 07 January 1943] was not only a great inventor / scientist, but also the greatest mind of all the time. He has done a plenty of research throughout his life, and highly recognized for his contributions towards the following : High Voltage, High Frequency Power Experiments Alternating Current (AC) Electricity Supply System Apart from the above-mentioned contributions, he has given ‘Universe Secret Code 369 Theory’ and has called the number 369 – the key to the universe. Now the question that will come to the curious minds is that why Nikola Tesla has called this number the key to the universe. The answer to this question is described in this post. Let start with a specific pattern as shown below: 1 1 + 1 => 2 2 + 2 => 4 4 + 4 => 8 8 + 8 => 16; 1 + 6 => 7 16 + 16 => 32; 3 + 2 => 5 >>>>>>...

The Black Hole Number 123

You might have heard the term black hole . A black hole is a region of spacetime where gravity is so strong that even light or electromagnetic waves cannot escape it. In Mathematics, the number 123 is called the black hole number. Let’s understand this amazing concept in detail. The Procedure Step 1 : Consider any number . Step 2 : Count the number of even digits. Step 3 : Count the number of odd digits. Step 4 : Count the number of total digits. Step 5 : Consider the number (" even " " odd " " total ") obtained in the n   iteration. Step 6 : Repeat the steps ( Step 1 to Step 5 ) after every iteration until you get the number (" even " " odd " " total ") as  123 . Note : If you repeat the steps ( Step 1 to Step 5 ) even after getting the number 123, you will obtain the same number i.e. 123 after every iteration. Example First Iteration Step 1 : Number 1234567890 . Step 2 : Number of  even  digits = 5 . Step 3 : Number of...