Find if a number is equal to the sum of its divisors
Finding divisors faster

Instead of checking all numbers until number / 2,
it's enough to search until sqrt(number),
and count the divisor pairs.
For example, in the case of 6,
initialize sum = 1, because 1 will be always part of the sum,
and then when you see 2, also add 6 / 2 to the sum.
(You can get sqrt with #include "math.h".)
Also,
you can break out of the loop when sum exceeds the target value.

There is one more important point that can slow your implementation down,
is that all the variables are double instead of int.
This is not only unnatural for the given task,
floating point math is expensive in general.
So simply rewriting the program so that number, i, m, n are all integers, will make a big difference.

Make perfectCheck return boolean

Currently perfectCheck returns the sum of divisors.
You could make it return a bool:

return sum == number;


You can get the bool type in C99+ with #include "stdbool.h".

And then you can write the main function a bit simpler:

for (i = 0; i &lt; n; i++)
{
    scanf("%d", &amp;m);
    printf("%d ", perfectCheck(m));
}