Most logical rectangle formula from numbers Introduction
The task is simple. When given a number, output the most logical rectangle. To explain what a logical rectangle is, I provided some examples:
Input: 24.
All possible rectangles have the form A x B, (A and B are both positive integers). So, all possible rectangles for 24 are:

1 x 24
2 x 12
4 x 6

From this list, the most logical rectangle has the lowest A + B:

1 + 24 = 25
2 + 12 = 14
4 + 6 = 10

You can see that 4 x 6 is the most logical rectangle, so we will output 4 x 6 (or 6 x 4).
The rules

Given an integer from 1 to 99999, output the most logical rectangle.
You may write a function or a program.
The spaces in the output are not required.
This is code-golf, so the submission with the least amount of bytes wins!

Test cases
Input &gt;   Output

1     &gt;   1 x 1
4     &gt;   2 x 2
8     &gt;   4 x 2 (or 2 x 4)
15    &gt;   5 x 3 (or 3 x 5)
47    &gt;   1 x 47 (or 47 x 1)
5040  &gt;   72 x 70 (or 70 x 72)
40320 &gt;   210 x 192 (or 192 x 210)
CJam, 26 bytes

ri_mQ),W%{1$\%!}=:X/" x "X


or

ri_mQ{)1$\%!},W=):X/" x "X


Test it here.

Finds the largest divisor less than or equal to the square root of the input as one of the two side lengths.