Created
October 31, 2018 09:30
-
-
Save istiyakamin/d6e4e7f398fe84a804142187198811e9 to your computer and use it in GitHub Desktop.
Number to Word(Money) converter
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function number2text(value) { | |
var fraction = Math.round(frac(value)*100); | |
var f_text = ""; | |
if(fraction > 0) { | |
f_text = "AND "+convert_number(fraction)+" POISA"; | |
} | |
return convert_number(value)+" TAKA "+f_text+" ONLY"; | |
} | |
function frac(f) { | |
return f % 1; | |
} | |
function convert_number(number) | |
{ | |
if ((number < 0) || (number > 999999999)) | |
{ | |
return "NUMBER OUT OF RANGE!"; | |
} | |
var Gn = Math.floor(number / 10000000); /* Crore */ | |
number -= Gn * 10000000; | |
var kn = Math.floor(number / 100000); /* lakhs */ | |
number -= kn * 100000; | |
var Hn = Math.floor(number / 1000); /* thousand */ | |
number -= Hn * 1000; | |
var Dn = Math.floor(number / 100); /* Tens (deca) */ | |
number = number % 100; /* Ones */ | |
var tn= Math.floor(number / 10); | |
var one=Math.floor(number % 10); | |
var res = ""; | |
if (Gn>0) | |
{ | |
res += (convert_number(Gn) + " CRORE"); | |
} | |
if (kn>0) | |
{ | |
res += (((res=="") ? "" : " ") + | |
convert_number(kn) + " LAKH"); | |
} | |
if (Hn>0) | |
{ | |
res += (((res=="") ? "" : " ") + | |
convert_number(Hn) + " THOUSAND"); | |
} | |
if (Dn) | |
{ | |
res += (((res=="") ? "" : " ") + | |
convert_number(Dn) + " HUNDRED"); | |
} | |
var ones = Array("", "ONE", "TWO", "THREE", "FOUR", "FIVE", "SIX","SEVEN", "EIGHT", "NINE", "TEN", "ELEVEN", "TWELVE", "THIRTEEN","FOURTEEN", "FIFTEEN", "SIXTEEN", "SEVENTEEN", "EIGHTEEN","NINETEEN"); | |
var tens = Array("", "", "TWENTY", "THIRTY", "FOURTY", "FIFTY", "SIXTY","SEVENTY", "EIGHTY", "NINETY"); | |
if (tn>0 || one>0) | |
{ | |
if (!(res=="")) | |
{ | |
res += " AND "; | |
} | |
if (tn < 2) | |
{ | |
res += ones[tn * 10 + one]; | |
} | |
else | |
{ | |
res += tens[tn]; | |
if (one>0) | |
{ | |
res += ("-" + ones[one]); | |
} | |
} | |
} | |
if (res=="") | |
{ | |
res = "zero"; | |
} | |
return res; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment