N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

13951

13951 is a odd composite number that follows 13950 and precedes 13952. It is composed of 4 distinct factors: 1, 7, 1993, 13951. Its prime factorization can be written as 7 × 1993. 13951 is classified as a deficient number based on the sum of its proper divisors. In computer science, 13951 is represented as 11011001111111 in binary and 367F in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
11011001111111
Base 2
Hexadecimal
367F
Base 16

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum19
Digital Root1
Sum of Factors15952
Aliquot Sum2001
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

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

Canonical form
7 × 1993
71993
Divisibility Insights
  • Divisible by 2

    13951 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 19 is not a multiple of 3.

  • Divisible by 4

    The last two digits 51 are not divisible by 4.

  • Divisible by 5

    13951 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 19 is not a multiple of 9.

  • Divisible by 10

    13951 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 13951 breaks down

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

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

Context

Where 13951 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (1394613956) to tune search ranges, and educators feature 13951 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 13951 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 13951

Is 13951 a prime number?

13951 is composite with 4 total factors and the prime factorization 7 × 1993.

What is the prime factorization of 13951?

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

How is 13951 represented in binary and hexadecimal?

13951 converts to 11011001111111 in binary and 367F in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 13951?

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