N
NumberPedia
Menu

© 2025 NumberPedia

Composite Number

1113

1113 is a odd composite number that follows 1112 and precedes 1114. It is composed of 8 distinct factors: 1, 3, 7, 21, 53, 159, 371, 1113. Its prime factorization can be written as 3 × 7 × 53. 1113 is classified as a deficient number based on the sum of its proper divisors. In computer science, 1113 is represented as 10001011001 in binary and 459 in hexadecimal. Historically, it is written as MCXIII in Roman numerals.

Roman Numeral
MCXIII
LatinClassic
Binary
10001011001
Base 2
Hexadecimal
459
Base 16

Factor Analysis

8 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count4
Digit Sum6
Digital Root6
Sum of Factors1728
Aliquot Sum615
ClassificationDeficient
Prime Factors3
SequencesComposite numbers, Deficient numbers
Prime Factorization

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

Canonical form
3 × 7 × 53
3753
Divisibility Insights
  • Divisible by 2

    1113 ends in 3, so it is odd.

  • Divisible by 3

    The digit sum 6 is a multiple of 3.

  • Divisible by 4

    The last two digits 13 are not divisible by 4.

  • Divisible by 5

    1113 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 6 is not a multiple of 9.

  • Divisible by 10

    1113 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 1113 breaks down

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

Numeral conversions provide additional context: the binary form 10001011001 supports bitwise reasoning, hexadecimal 459 aligns with computing notation, and the Roman numeral MCXIII keeps the encyclopedic tradition alive. These attributes make 1113 useful for math olympiad problems, puzzle design, and code challenges alike.

Context

Where 1113 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (11081118) to tune search ranges, and educators feature 1113 in worksheets about factor trees. Its binary footprint of length 11 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 1113 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 1113

Is 1113 a prime number?

1113 is composite with 8 total factors and the prime factorization 3 × 7 × 53.

What is the prime factorization of 1113?

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

How is 1113 represented in binary and hexadecimal?

1113 converts to 10001011001 in binary and 459 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 1113?

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