Harshad Number

A Harshad number, or Niven number in a given number base, is an integer that is divisible by the sum of its digits when written in that base.

Harshad numbers were defined by D. R. Kaprekar, a mathematician from India. The word “Harshad” comes from the Sanskrit harṣa (joy) + da (give), meaning joy-giver. The Niven numbers take their name from Ivan M. Niven from a paper delivered at a conference on number theory in 1997. All integers between zero and n are Harshad numbers in base n.
Stated mathematically, let X be a positive integer with m digits when written in base n, and let the digits be ai (i = 0, 1, …, m − 1). (It follows that ai must be either zero or a positive integer up to n − 1.) X can be expressed as

If there exists an integer A such that the following holds, then X is a Harshad number in base n:

Given the divisibility test for 9, one might be tempted to generalize that all numbers divisible by 9 are also Harshad numbers. But for the purpose of determining the Harshadness of n, the digits of n can only be added up once and n must be divisible by that sum; otherwise, it is not a Harshad number. For example, 99 is not a Harshad number, since 9 + 9 = 18, and 99 is not divisible by 18.
The base number (and furthermore, its powers) will always be a Harshad number in its own base, since it will be represented as “10″ and 1 + 0 = 1.
For a prime number to also be a Harshad number, it must be less than the base number, (that is, a 1-digit number) or the base number itself. Otherwise, the digits of the prime will add up to a number that is more than 1 but less than the prime, and obviously, it will not be divisible.
Although the sequence of factorials starts with Harshad numbers in base 10, not all factorials are Harshad numbers. 432! is the first that is not.
H.G. Grundman proved in 1994 that, in base 10, no 21 consecutive integers are all Harshad numbers. She also found the smallest 20 consecutive integers that are all Harshad numbers; they exceed 1044363342786.
In binary, there are infinitely many sequences of four consecutive Harshad numbers; in ternary, there are infinitely many sequences of six consecutive Harshad numbers. Both of these facts were proven by T. Cai in 1996.
In general, such maximal sequences run from N · bk – b to N · bk + (b-1), where b is the base, k is a relatively large power, and N is a constant. Interpolating zeroes into N will not change the sequence of digital sums, so it is possible to convert any solution into a larger one by interpolating a suitable number of zeroes, just as 21 and 201 and 2001 are all Harshad numbers base 10. Thus any solution implies an infinite class of solutions.
Harshad mobile numbers are used to make free untraceable calls mostley used by scammers and phishers to get either personal info or your money or both.