N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

55913

55913 is a odd composite number that follows 55912 and precedes 55914. It is composed of 16 distinct factors: 1, 11, 13, 17, 23, 143, 187, 221, 253, 299, 391, 2431, 3289, 4301, 5083, 55913. Its prime factorization can be written as 11 × 13 × 17 × 23. 55913 is classified as a deficient number based on the sum of its proper divisors. In computer science, 55913 is represented as 1101101001101001 in binary and DA69 in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
1101101001101001
Base 2
Hexadecimal
DA69
Base 16

Factor Analysis

16 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum23
Digital Root5
Sum of Factors72576
Aliquot Sum16663
ClassificationDeficient
Prime Factors4
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (11 × 13 × 17 × 23) reveals 4 prime building blocks.

Canonical form
11 × 13 × 17 × 23
11131723
Divisibility Insights
  • Divisible by 2

    55913 ends in 3, so it is odd.

  • Divisible by 3

    The digit sum 23 is not a multiple of 3.

  • Divisible by 4

    The last two digits 13 are not divisible by 4.

  • Divisible by 5

    55913 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 23 is not a multiple of 9.

  • Divisible by 10

    55913 does not end in 0.

  • Divisible by 11

    The alternating digit sum 11 is a multiple of 11.

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 55913 breaks down

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

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

Context

Where 55913 shows up

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

Is 55913 a prime number?

55913 is composite with 16 total factors and the prime factorization 11 × 13 × 17 × 23.

What is the prime factorization of 55913?

It breaks down as 11 × 13 × 17 × 23, multiplying the primes 11 × 13 × 17 × 23.

How is 55913 represented in binary and hexadecimal?

55913 converts to 1101101001101001 in binary and DA69 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 55913?

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