Finds Prime Number From Sum of Prime Factors

#include <iostream>
using namespace std;

bool isDivisible(int, int);
bool isPrime(int);
bool isSumPrimeFactorPrime(int);

int main() {
    int notPrimeNumber = 0;
    for (int i = 0; i < 1000; i++) {
        if (!isPrime(i)) {
            notPrimeNumber = i;
            isSumPrimeFactorPrime(notPrimeNumber);
        }
    }
}

bool isSumPrimeFactorPrime(int number) {
    int primeFactorSum = 0;
    int notPrimeNumber = number;
    for (int i = 2; i <= number; i++) {
        if ((number % i == 0)) {
            number /= i;
            primeFactorSum += i;
            i = 1;
        }
    }
    if (isPrime(primeFactorSum)) {
        cout << notPrimeNumber << " has a prime number of prime factor sum = " << primeFactorSum << endl;
        return true;
    }
    else {
        return false;
    }
}

bool isPrime(int number) {
    for (int i = 2; i < number; i++) {
        if (isDivisible(number, i)) {
            return false;
        }
    }
    return true;
}

bool isDivisible(int number, int divisor) {
    return number % divisor == 0;
}