Study guide
4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal
Praxis Computer Science 5652
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode
1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy
2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects
2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations
3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security
3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage
4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation
4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing
5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization
5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range
6 Chapter 6: Algorithms: Searching, Sorting, and Recursion
6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents
7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions
7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra
8 Chapter 8: Programming: Selection, Iteration, and Writing Code
8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code
9 Chapter 9: Programming: Procedures, Arrays, and Data Structures
9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)
10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality
10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback
11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs
11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs
12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design
12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding
13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection
14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing
15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments
15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored
16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity
16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs
4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal
Key Takeaways Explain This Topic AI
In a positional number system with base b, each digit is multiplied by a power of b: binary uses powers of 2, octal powers of 8, decimal powers of 10, and hexadecimal powers of 16.
One hexadecimal digit stands for exactly 4 bits, and one octal digit stands for exactly 3 bits, so converting between binary and these bases only requires grouping bits.
To convert a decimal integer to base b, divide repeatedly by b and read the remainders from last to first.
Hexadecimal digits A through F represent the values 10 through 15; for example, E7 in hexadecimal equals 14 × 16 + 7 = 231 in decimal.
To compare numbers written in different bases, convert them all to one base, usually decimal, before comparing.
Last updated: September 2026
What this competency asks
ETS asks you to understand number base conversion and binary, decimal, and hexadecimal number systems :
Convert between number bases.
Analyze and compare representations of numbers in different bases.
The discussion questions also mention octal , so be ready for base 8. Expect questions such as "What is the hexadecimal representation of this decimal number?" or "Which of these values is largest?", with the values written in mixed bases.
Positional notation
In base b , each position is worth a power of b, starting from b⁰ = 1 at the right. Each digit must be less than b.
- Base Name Digits Place values (right to left)
- 2 Binary 0, 1 1, 2, 4, 8, 16, 32, 64, 128, …
- 8 Octal 0–7 1, 8, 64, 512, …
- 10 Decimal 0–9 1, 10, 100, 1000, …
- 16 Hexadecimal 0–9, A–F 1, 16, 256, 4096, …
In hexadecimal, A = 10, B = 11, C = 12, D = 13, E = 14, F = 15 . A subscript shows the base (E7₁₆, 11100111₂). Programming languages often use prefixes instead: 0x for hex, 0b for binary.
Powers of 2 worth memorizing
- 2⁰ 2¹ 2² 2³ 2⁴ 2⁵ 2⁶ 2⁷ 2⁸ 2⁹ 2¹⁰
- 1 2 4 8 16 32 64 128 256 512 1024
- Converting to decimal: expand by place value
Multiply each digit by its place value and add.
Binary to decimal: 11010110₂
- Place value 128 64 32 16 8 4 2 1
- Digit 1 1 0 1 0 1 1 0
128 + 64 + 16 + 4 + 2 = 214 .
Hexadecimal to decimal: 3A4₁₆ = 3 × 256 + 10 × 16 + 4 × 1 = 768 + 160 + 4 = 932 .
Octal to decimal: 1365₈ = 1 × 512 + 3 × 64 + 6 × 8 + 5 × 1 = 512 + 192 + 48 + 5 = 757 .
Converting from decimal: repeated division
To convert a decimal integer to base b, divide by b, record the remainder, and repeat with the quotient until the quotient is 0. Read the remainders from bottom to top : the last remainder is the most significant digit.
156 to binary
- Division Quotient Remainder
- 156 ÷ 2 78 0 (least significant)
- 78 ÷ 2 39 0
- 39 ÷ 2 19 1
- 19 ÷ 2 9 1
- 9 ÷ 2 4 1
- 4 ÷ 2 2 0
- 2 ÷ 2 1 0
- 1 ÷ 2 0 1 (most significant)
Reading upward: 156 = 10011100₂ . Check: 128 + 16 + 8 + 4 = 156.
500 to hexadecimal
- Division Quotient Remainder
- 500 ÷ 16 31 4
- 31 ÷ 16 1 15 → F
- 1 ÷ 16 0 1
Reading upward: 500 = 1F4₁₆ . Check: 1 × 256 + 15 × 16 + 4 = 256 + 240 + 4 = 500.
ETS's sample question on this topic converts 231 to hexadecimal. Because 231 = 14 × 16 + 7, the answer is E7₁₆ . The wrong choices differ by a single digit or a misplaced remainder, so always check your answer by converting back.
A faster alternative for binary is subtracting powers of 2 . For 156, the largest power of 2 that fits is 128, leaving 28. Then 16 fits, leaving 12. Then 8, leaving 4. Then 4, leaving 0. Place 1s under 128, 16, 8, and 4 and 0s everywhere else.
Binary ↔ hexadecimal and octal: group the bits
Because 16 = 2⁴, each hex digit is exactly 4 bits (a nibble ). Because 8 = 2³, each octal digit is exactly 3 bits.
Binary to hex: group from the right in fours, padding the leftmost group with zeros.
1011110101₂ → 0010 1111 0101 → 2, F, 5 → 2F5₁₆
Binary to octal: group from the right in threes.
1011110101₂ → 001 011 110 101 → 1, 3, 6, 5 → 1365₈
Hex to binary: replace each hex digit with its 4 bits.
9C7₁₆ → 9 = 1001 , C = 1100 , 7 = 0111 → 100111000111₂
All three results for 1011110101₂ agree: 2F5₁₆ = 1365₈ = 757₁₀.
Reference table, 0–15
- Decimal Binary Octal Hex
- 0 0000 0 0
- 1 0001 1 1
- 2 0010 2 2
- 3 0011 3 3
- 4 0100 4 4
- 5 0101 5 5
- 6 0110 6 6
- 7 0111 7 7
- 8 1000 10 8
- 9 1001 11 9
- 10 1010 12 A
- 11 1011 13 B
- 12 1100 14 C
- 13 1101 15 D
- 14 1110 16 E
- 15 1111 17 F
- Analyzing and comparing representations
Comparing values: convert everything to decimal first. Example: which is largest, 3F₁₆, 1000000₂, 77₈, or 62₁₀? The values are 63, 64, 63, and 62, so 1000000₂ is largest.
Digit count: the same value needs more digits in a smaller base. 255 is 11111111 in binary (8 digits), 377 in octal (3 digits), and FF in hex (2 digits). That compactness is why programmers use hex.
Range of n digits: n binary digits represent 2ⁿ different values, from 0 to 2ⁿ − 1. Two hex digits (one byte) cover 0–255.
Recognizing invalid numbers: 129₈ is not a valid octal number, because octal has no digit 9. 1G₁₆ is not valid hex.
Quick parity check: a binary number is even exactly when its last bit is 0.
Where each base appears in computing
- Base Common uses
- Binary How hardware stores and processes all data
- Hexadecimal Memory addresses, color codes such as #FF8800 , MAC addresses, IPv6 addresses, byte dumps
- Octal Unix file permissions, such as chmod 755 (rwxr-xr-x)
- Decimal Human-facing input and output
Chapter 13 builds on these conversions with bits and bytes, character codes, colors, and two's complement.