See: Description
Class  Description 

BitTools 
This class provides static methods that make it easier to work with groups
of bits. Since working with individual bits is relatively easy, our
emphasis is primarily on groups of bits.

ConvertNumber 
This class provides static number conversion methods.

Fib 
The
Fib class is an implementation of the famous recursive
Fibonacci Sequence where each number is the sum of the previous two
numbers. To make this sequence function, however, the first number
must be nonzero (the number 1 is normally selected). The Fibonacci
Sequence begins like this when the first number is 1: 
Mathcentric methods that can be useful for handling numbers in uncommon ways.