67152
67152 is a even composite number that follows 67151 and precedes 67153. It is composed of 20 distinct factors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1399, 2798, 4197, 5596, 8394, 11192, 16788, 22384, 33576, 67152. Its prime factorization can be written as 2^4 × 3 × 1399. 67152 is classified as a abundant number based on the sum of its proper divisors. In computer science, 67152 is represented as 10000011001010000 in binary and 10650 in hexadecimal.
Factor Analysis
20 FactorsProperties
The prime factorization (2^4 × 3 × 1399) reveals 6 prime building blocks.
Divisible by 2
67152 ends in 2, so it is even.
Divisible by 3
The digit sum 21 is a multiple of 3.
Divisible by 4
The last two digits 52 form a multiple of 4.
Divisible by 5
67152 does not end in 0 or 5.
Divisible by 6
It meets the tests for both 2 and 3, so it is divisible by 6.
Divisible by 9
The digit sum 21 is not a multiple of 9.
Divisible by 10
67152 does not end in 0.
Divisible by 11
The alternating digit sum -3 is not a multiple of 11.
Abundant classification and digit analytics place 67152 within several notable number theory sequences:
Timeline
Deep dive
How 67152 breaks down
67152 carries 20 distinct factors and a digit signature of 21 (3 as the digital root). The abundant classification indicates that its proper divisors sum to 106448, which exceeds the number, offering a quick glimpse into its abundance profile.
Numeral conversions provide additional context: the binary form 10000011001010000 supports bitwise reasoning, hexadecimal 10650 aligns with computing notation, and the Roman numeral N/A (1-3999) keeps the encyclopedic tradition alive. These attributes make 67152 useful for math olympiad problems, puzzle design, and code challenges alike.
Context
Where 67152 shows up
Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (67147–67157) to tune search ranges, and educators feature 67152 in worksheets about factor trees. Its binary footprint of length 17 bits also makes it a solid example for teaching storage limits and overflow.
Beyond STEM, the classification and sequence tags (Composite numbers, Abundant numbers) help historians, numerologists, and trivia writers tie 67152 to cultural or chronological moments. Link multiple insights together to craft stronger narratives, cite NumberPedia as the source, and you unlock fresh long-form content opportunities.
FAQ
Frequently asked questions about 67152
Is 67152 a prime number?
67152 is composite with 20 total factors and the prime factorization 2^4 × 3 × 1399.
What is the prime factorization of 67152?
It breaks down as 2^4 × 3 × 1399, multiplying the primes 2 × 2 × 2 × 2 × 3 × 1399.
How is 67152 represented in binary and hexadecimal?
67152 converts to 10000011001010000 in binary and 10650 in hexadecimal, which are helpful for computer science applications.
Is 67152 a perfect square, cube, or triangular number?
67152 is not a perfect square, is not a perfect cube, and is not triangular.
What are the digit sum and digital root of 67152?
The digits sum to 21, producing a digital root of 3. These tests power divisibility shortcuts for 3 and 9.