I want to find out how many comparisons it takes to sort N items using a quicksort.

I know on average it takes NlogN comparisons, but as this is bigOnotation im guessing the logarithmic base isnt exact.... so im going to assume that i cant just do:

Sort 1000 items
Average comparisons = 1000 * ln1000 = 6908 comparisons?