What is quicker to check if a number is even or not? Checking the bits, or performing a modulus operation?

is-even.php

<?php
/**
 * Check if a number is even by examining the bit for 1 (ie the odd number 'flag')
 */
function isEvenBit(int $num): bool
{
    return !($num & 0b1);
}

/**
 * Check if a number is even by examining if the remainder of an n mod 2 calculation is zero
 */
function isEvenMod(int $num): bool
{
    return ($num % 2) === 0;
}


$start = microtime(true);
for ($i=0; $i<1000000000; $i++) {
    isEvenBit($i);
}
echo "\nBit check ran in " . (microtime(true) - $start) . "seconds\n";

$start = microtime(true);
for ($i=0; $i<1000000000; $i++) {
    isEvenMod($i);
}
echo "\nModulo check ran in " . (microtime(true) - $start) . "seconds\n";