Hello, readers. This article focuses on Implementing the **Harshad number in Python** with scenarios and examples.

So, let us begin! ðŸ™‚

## Understanding the Harshad Number

Number System, as we all, is the base of every mathematical model in this universe. When it comes to programming, we do deal with numbers and a way to manipulate the data variables through in-built modules and functions.

One such concept of number is a Harshad Number.

Harshad Number is an integer that is divisible by the sum of its digits when written in that base.

So, at first, we need to accept the data value as input. Further, we need to segregate the original number to get hold of all the digits that make up the number individually. Then, we perform a summation of all the digits that collectively make up the actual number.

The final step is to divide the original number by the summation results. If the result is 0, it states that the number is completely divisible by the summation score. Thus, we can state the original number as a Harshad number.

If we get any non-zero value as the output of the modulus operation, we conclude that the original number is not a Harshad number.

## Scenarios for Harshad Number

Now, let us try implementing the above pseudo logic on actual numbers.

**Example**:

Input number: 156

Digits of the number: 1, 5 and 6

Summation of digits: 1 + 5 + 6 = 12

Modulus operation: 156%12 = 0

As the result of the mod operation is zero, we state that 156 is a Harshad number.

## Generic Algorithm of Harshad Number

To check for a Harshad Number, we need to follow the below algorithm.

- Accept the number as input.
- We usually store a copy of this input value separately for comparision later in the process.
- We then traverse through the number using a while or for loop to get the entire number in a separate digit form.
- While traversing, we keep adding the digits to get the summation of all the digits.
- Repeat the step 3 and 4 until all the digits are exhausted.
- Divide the original number by the summation results
- If the number is completely divisible and returns zero as the remainder score, then we conclude the number to be a Harshad number.

## Implementing Harshad number in Python

Have a look at the below code.

**Example:**

```
num = input()
num =int(num)
num_n=num
ans = 0
while(num!=0):
dig = num%10
ans=ans + dig
num=int(num/10)
if(num_n % ans == 0):
print("The entered num is a Harshad Number!")
else:
print("It is not a Harshad Number!")
```

**Explanation:**

- At first, we accept the number from the user input() function.
- We store the original’s number copy into an another variable for comparison at the end.
- We traverse through the digits of the number using the while loop. Using the mod operator, we try to extract a digit at a single instance of loop from the number and then perform summation of the digits to store the result of the summation in the variable
**ans**. - At last, we perform mod operation on the original number and the summation score. If it results into 0, we conclude that number as a Harshad number.

**Output:**

```
153
The entered num is a Harshad Number!
12
The entered num is a Harshad Number!
155
It is not a Harshad Number!
```

## Conclusion

By this, we have come to the end of this topic. Feel free to comment below, in case you have any questions.

For more such posts related to Python programming, Stay tuned with us.

Till then, Happy Learning! ðŸ™‚