N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15967

15967 is a odd composite number that follows 15966 and precedes 15968. It is composed of 4 distinct factors: 1, 7, 2281, 15967. Its prime factorization can be written as 7 × 2281. 15967 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15967 is represented as 11111001011111 in binary and 3E5F in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
11111001011111
Base 2
Hexadecimal
3E5F
Base 16

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum28
Digital Root1
Sum of Factors18256
Aliquot Sum2289
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (7 × 2281) reveals 2 prime building blocks.

Canonical form
7 × 2281
72281
Divisibility Insights
  • Divisible by 2

    15967 ends in 7, so it is odd.

  • Divisible by 3

    The digit sum 28 is not a multiple of 3.

  • Divisible by 4

    The last two digits 67 are not divisible by 4.

  • Divisible by 5

    15967 does not end in 0 or 5.

  • Divisible by 6

    A number must be divisible by 2 and 3 to pass the 6-test.

  • Divisible by 9

    The digit sum 28 is not a multiple of 9.

  • Divisible by 10

    15967 does not end in 0.

  • Divisible by 11

    The alternating digit sum 6 is not a multiple of 11.

Sequence Membership

Deficient classification and digit analytics place 15967 within several notable number theory sequences:

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15967 breaks down

15967 carries 4 distinct factors and a digit signature of 28 (1 as the digital root). The deficient classification indicates that its proper divisors sum to 2289, which stays below the number, offering a quick glimpse into its abundance profile.

Numeral conversions provide additional context: the binary form 11111001011111 supports bitwise reasoning, hexadecimal 3E5F aligns with computing notation, and the Roman numeral N/A (1-3999) keeps the encyclopedic tradition alive. These attributes make 15967 useful for math olympiad problems, puzzle design, and code challenges alike.

Context

Where 15967 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (1596215972) to tune search ranges, and educators feature 15967 in worksheets about factor trees. Its binary footprint of length 14 bits also makes it a solid example for teaching storage limits and overflow.

Beyond STEM, the classification and sequence tags (Composite numbers, Deficient numbers) help historians, numerologists, and trivia writers tie 15967 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 15967

Is 15967 a prime number?

15967 is composite with 4 total factors and the prime factorization 7 × 2281.

What is the prime factorization of 15967?

It breaks down as 7 × 2281, multiplying the primes 7 × 2281.

How is 15967 represented in binary and hexadecimal?

15967 converts to 11111001011111 in binary and 3E5F in hexadecimal, which are helpful for computer science applications.

Is 15967 a perfect square, cube, or triangular number?

15967 is not a perfect square, is not a perfect cube, and is not triangular.

What are the digit sum and digital root of 15967?

The digits sum to 28, producing a digital root of 1. These tests power divisibility shortcuts for 3 and 9.