Skip to main content

Nivenmorphic Number or Harshadmorphic Number

A Nivenmorphic number or Harshadmorphic number is a positive integer whose sum of digits is the last digits of the number i.e. the sum of the digits terminates the number.

The Concept

Step 1: Take any positive integer.

Step 2: Calculate the sum of the digits of the number.

Step 3: If the sum of the digits is the last digits of the number i.e. the sum of the digits terminates the number, then the number is a Nivenmorphic number or Harshadmorphic number, else not.

For Example

Number: 16218

Sum of the digits of the number: [1 + 6 + 2 + 1 + 8] => 18

Here, the sum of the digits 18 is the last digits of the number i.e. the sum of the digits terminates the number. Hence, the number 16218 is a Nivenmorphic number or Harshadmorphic number.

Hope you have understood this amazing concept of Nivenmorphic number or Harshadmorphic number. You can try yourself using any other positive integer. In case of any issue, kindly provide your valuable comments.

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

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

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