Is this a Hardy-Ramanujan-Number-ish Harshad Number?
ArnoldC, 888 Bytes
IT'S SHOWTIME
HEY CHRISTMAS TREE i
YOU SET US UP 0
GET YOUR ASS TO MARS i
DO IT NOW
I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY
HEY CHRISTMAS TREE a
YOU SET US UP 0
GET TO THE CHOPPER a
HERE IS MY INVITATION 1
YOU ARE NOT YOU YOU ARE ME i
ENOUGH TALK
HEY CHRISTMAS TREE b
YOU SET US UP 0
GET TO THE CHOPPER b
HERE IS MY INVITATION 81
YOU ARE NOT YOU YOU ARE ME i
ENOUGH TALK
HEY CHRISTMAS TREE c
YOU SET US UP 0
GET TO THE CHOPPER c
HERE IS MY INVITATION 1458
YOU ARE NOT YOU YOU ARE ME i
ENOUGH TALK
HEY CHRISTMAS TREE d
YOU SET US UP 0
GET TO THE CHOPPER d
HERE IS MY INVITATION 1729
YOU ARE NOT YOU YOU ARE ME i
ENOUGH TALK
HEY CHRISTMAS TREE res
YOU SET US UP 0
GET TO THE CHOPPER res
HERE IS MY INVITATION a
CONSIDER THAT A DIVORCE b
CONSIDER THAT A DIVORCE c
CONSIDER THAT A DIVORCE d
ENOUGH TALK
TALK TO THE HAND res
YOU HAVE BEEN TERMINATED
I know, I just check for equality, but that shouldn't be the fun part of the program.
Enjoy reading it. :)
Added some newlines there for easier readability:
Try it online
Neim, 5 bytes
D
Explanation:
Example input: 1729
Implicitly convert to digit list and um the digits [19]
D Duplicate [19, 19]
everse [19, 91]
muliply [1729]
check for quality with input [1]
Implicit output: 1
Try it!
x86 Assembly, 55 35 33 31 bytes:
Assumes an ABI where the return value is in EAX and parameters are pushed on the stack... so almost all of them.
00000000: 8B 44 24 04 mov eax,dword ptr [esp+4]
00000004: 48 dec eax
00000005: 74 16 je 0000001D
00000007: 83 E8 50 sub eax,50h
0000000A: 74 11 je 0000001D
0000000C: 2D 61 05 00 00 sub eax,561h
00000011: 74 0A je 0000001D
00000013: 2D 0F 01 00 00 sub eax,10Fh
00000018: 74 03 je 0000001D
0000001A: 33 C0 xor eax,eax
0000001C: C3 ret
0000001D: 40 inc eax
0000001E: C3 ret