N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15555

15555 is a odd composite number that follows 15554 and precedes 15556. It is composed of 16 distinct factors: 1, 3, 5, 15, 17, 51, 61, 85, 183, 255, 305, 915, 1037, 3111, 5185, 15555. Its prime factorization can be written as 3 × 5 × 17 × 61. 15555 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15555 is represented as 11110011000011 in binary and 3CC3 in hexadecimal.

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

Factor Analysis

16 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum21
Digital Root3
Sum of Factors26784
Aliquot Sum11229
ClassificationDeficient
Prime Factors4
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3 × 5 × 17 × 61) reveals 4 prime building blocks.

Canonical form
3 × 5 × 17 × 61
351761
Divisibility Insights
  • Divisible by 2

    15555 ends in 5, so it is odd.

  • Divisible by 3

    The digit sum 21 is a multiple of 3.

  • Divisible by 4

    The last two digits 55 are not divisible by 4.

  • Divisible by 5

    15555 ends in 5, so it is divisible by 5.

  • Divisible by 6

    A number must be divisible by 2 and 3 to pass the 6-test.

  • Divisible by 9

    The digit sum 21 is not a multiple of 9.

  • Divisible by 10

    15555 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 15555 within several notable number theory sequences:

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15555 breaks down

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

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

Context

Where 15555 shows up

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

Is 15555 a prime number?

15555 is composite with 16 total factors and the prime factorization 3 × 5 × 17 × 61.

What is the prime factorization of 15555?

It breaks down as 3 × 5 × 17 × 61, multiplying the primes 3 × 5 × 17 × 61.

How is 15555 represented in binary and hexadecimal?

15555 converts to 11110011000011 in binary and 3CC3 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 15555?

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