The below table visualizes how the decimal number 2147483648 equals the binary number 10000000000000000000000000000000.

1 | × | 2^{31} | = | 2147483648 | |

+ | 0 | × | 2^{30} | = | 0 |

+ | 0 | × | 2^{29} | = | 0 |

+ | 0 | × | 2^{28} | = | 0 |

+ | 0 | × | 2^{27} | = | 0 |

+ | 0 | × | 2^{26} | = | 0 |

+ | 0 | × | 2^{25} | = | 0 |

+ | 0 | × | 2^{24} | = | 0 |

+ | 0 | × | 2^{23} | = | 0 |

+ | 0 | × | 2^{22} | = | 0 |

+ | 0 | × | 2^{21} | = | 0 |

+ | 0 | × | 2^{20} | = | 0 |

+ | 0 | × | 2^{19} | = | 0 |

+ | 0 | × | 2^{18} | = | 0 |

+ | 0 | × | 2^{17} | = | 0 |

+ | 0 | × | 2^{16} | = | 0 |

+ | 0 | × | 2^{15} | = | 0 |

+ | 0 | × | 2^{14} | = | 0 |

+ | 0 | × | 2^{13} | = | 0 |

+ | 0 | × | 2^{12} | = | 0 |

+ | 0 | × | 2^{11} | = | 0 |

+ | 0 | × | 2^{10} | = | 0 |

+ | 0 | × | 2^{9} | = | 0 |

+ | 0 | × | 2^{8} | = | 0 |

+ | 0 | × | 2^{7} | = | 0 |

+ | 0 | × | 2^{6} | = | 0 |

+ | 0 | × | 2^{5} | = | 0 |

+ | 0 | × | 2^{4} | = | 0 |

+ | 0 | × | 2^{3} | = | 0 |

+ | 0 | × | 2^{2} | = | 0 |

+ | 0 | × | 2^{1} | = | 0 |

+ | 0 | × | 2^{0} | = | 0 |

= | 2147483648 |

Binary numbers are a positional numeral system with the base (or "radix") 2. This means that binary digit (or "bit") only has two states: 1 and 0. As a result, binary numbers are well suited for electronic circuits since they can be represented as ON or OFF states, and they're therefore used as the fundamental data format in computers. A collection of 8 bits is commonly referred to as Byte. There are 2^{8} different combinations of bits in a byte, and it can therefore be used to represent integers between 0 and 255. To represent one quadrillion (the largest number supported on integers.info), a total of 50 bits are required.