N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15351

15351 is a odd composite number that follows 15350 and precedes 15352. It is composed of 16 distinct factors: 1, 3, 7, 17, 21, 43, 51, 119, 129, 301, 357, 731, 903, 2193, 5117, 15351. Its prime factorization can be written as 3 × 7 × 17 × 43. 15351 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15351 is represented as 11101111110111 in binary and 3BF7 in hexadecimal.

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

Factor Analysis

16 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum15
Digital Root6
Sum of Factors25344
Aliquot Sum9993
ClassificationDeficient
Prime Factors4
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3 × 7 × 17 × 43) reveals 4 prime building blocks.

Canonical form
3 × 7 × 17 × 43
371743
Divisibility Insights
  • Divisible by 2

    15351 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 15 is a multiple of 3.

  • Divisible by 4

    The last two digits 51 are not divisible by 4.

  • Divisible by 5

    15351 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 15 is not a multiple of 9.

  • Divisible by 10

    15351 does not end in 0.

  • Divisible by 11

    The alternating digit sum -5 is not a multiple of 11.

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15351 breaks down

15351 carries 16 distinct factors and a digit signature of 15 (6 as the digital root). The deficient classification indicates that its proper divisors sum to 9993, which stays below the number, offering a quick glimpse into its abundance profile.

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

Context

Where 15351 shows up

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

Is 15351 a prime number?

15351 is composite with 16 total factors and the prime factorization 3 × 7 × 17 × 43.

What is the prime factorization of 15351?

It breaks down as 3 × 7 × 17 × 43, multiplying the primes 3 × 7 × 17 × 43.

How is 15351 represented in binary and hexadecimal?

15351 converts to 11101111110111 in binary and 3BF7 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 15351?

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