compiled using Turbo c++ 3.0 compiler
Have you considered dropping that ancient piece of shit and switching to a compiler that isn't twenty years old and severely limited under modern architectures?
it can't find the factorial of no. grater than six
If this were true I would be confused, but your algorithm is correct and works for values of N greater than six. However, factorials grow at an insane rate, and despite using long double to counteract that growth, you're still going to exceed limits (thus invoking undefined behavior) very quickly.
If you want arbitrarily large factorials, you need some kind of big number library such as GMP.