N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15113

15113 is a odd composite number that follows 15112 and precedes 15114. It is composed of 8 distinct factors: 1, 7, 17, 119, 127, 889, 2159, 15113. Its prime factorization can be written as 7 × 17 × 127. 15113 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15113 is represented as 11101100001001 in binary and 3B09 in hexadecimal.

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

Factor Analysis

8 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum11
Digital Root2
Sum of Factors18432
Aliquot Sum3319
ClassificationDeficient
Prime Factors3
SequencesComposite numbers, Deficient numbers
Prime Factorization

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

Canonical form
7 × 17 × 127
717127
Divisibility Insights
  • Divisible by 2

    15113 ends in 3, so it is odd.

  • Divisible by 3

    The digit sum 11 is not a multiple of 3.

  • Divisible by 4

    The last two digits 13 are not divisible by 4.

  • Divisible by 5

    15113 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 11 is not a multiple of 9.

  • Divisible by 10

    15113 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15113 breaks down

15113 carries 8 distinct factors and a digit signature of 11 (2 as the digital root). The deficient classification indicates that its proper divisors sum to 3319, which stays below the number, offering a quick glimpse into its abundance profile.

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

Context

Where 15113 shows up

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

Is 15113 a prime number?

15113 is composite with 8 total factors and the prime factorization 7 × 17 × 127.

What is the prime factorization of 15113?

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

How is 15113 represented in binary and hexadecimal?

15113 converts to 11101100001001 in binary and 3B09 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 15113?

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