human
Super Niven Numbers | Checks if sums of all subsets of digits array divides the number N.
To calculate length of array arr.
There are totoal 2 ^ n subsets.
Consider all numbers from 0 to 2 ^ n - 1.
Consider binary representation of current i to decide which elements to pick ..
Check sum of picked elements ..
Function to check if a number is a super - niven number.
To store digits of N.
Driver code"
Solution in Python:

=====
What is a code to super Niven Numbers and the other steps required?
assistant
#Here is code to super Niven Numbers and the other steps required.
 def isDivBySubsetSums ( arr , num ) :
	n = len ( arr )
	total = 1 << n
	i = 0
	while i < total :
		sum = 0
		j = 0
		while j < n :
			if ( i & ( 1 << j ) ) :
				sum += arr [ j ]
			j += 1
		if ( sum != 0 ) and ( num % sum != 0 ) :
			return False
		i += 1
	return True
def isSuperNivenNum ( n ) :
	temp = n
	digits = [ ]
	while ( n > 1 ) :
		digit = int ( n ) % 10
		digits . append ( digit )
		n = n / 10
	return isDivBySubsetSums ( digits , temp )
if __name__ == ' _ _ main _ _ ' :
	n = 500
	if isSuperNivenNum ( n ) :
		print ( " Yes " )
	else :
		print ( " No " )