function div2( x ) {
	var str = '';
	var y;

	// We repeatedly divide by 2 and check for a remainder. If a remainder exists, the number is odd and we add a '1' bit...
	while ( x > 0 ) {
		y = x / 2.0;
		x = floor( y );
		if ( y === x ) {
			str = '0' + str;
		} else {
			str = '1' + str;
		}
	}
	return str;
}
Converts a nonnegative integer to a literal bit representation using the divide-by-2 algorithm.

@private
@param {NonNegativeInteger} x - nonnegative integer
@returns {BinaryString} bit representation

@example
var v = div2( 3 );
// returns '11'

@example
var v = div2( 0 );
// returns ''

@example
var v = div2( 12 );
// returns '1100'

@example
var v = div2( 188 );
// returns '10111100'