PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
Harshad number (Definition)

Consider the integer 1729. Adding up its digits,

$\displaystyle 1 + 7 + 2 + 9 = 19$
and
$\displaystyle {{1729} \over {19}} = 91.$

When an integer is divisible by the sum of its digits, it's called a Harshad number or Niven number. That is, given m is the number of digits of n and d is an integer of n,

$\displaystyle {\sum_{i = 1}^m d_i}\vert n$

All 1-digit numbers and the base number itself are Harshad numbers. 1, 2, 4 and 6 are always Harshad numbers regardless of the base.

It is possible for an integer to be divisible by its digital root and yet not be a Harshad number because it doesn't divide its first digit sum evenly (for example, 38 in base 10 has digital root 2 but is not divisible by 3 + 8 = 11). The reverse is also possible (for example, 195 is divisible by 1 + 9 + 5 = 15, but not by its digital root 4).



"Harshad number" is owned by Mravinci. [ owner history (3) ]
(view preamble)

View style:

Other names:  Niven number
Also defines:  Harshad number
Log in to rate this entry.
(view current ratings)

Cross-references: digit sum, divide, digital root, base, number, sum, divisible, digits, integer
There are 4 references to this entry.

This is version 2 of Harshad number, born on 2006-03-18, modified 2006-06-13.
Object id is 7742, canonical name is HarshadNumber.
Accessed 2584 times total.

Classification:
AMS MSC11A63 (Number theory :: Elementary number theory :: Radix representation; digital problems)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)