N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15111

15111 is a odd composite number that follows 15110 and precedes 15112. It is composed of 12 distinct factors: 1, 3, 9, 23, 69, 73, 207, 219, 657, 1679, 5037, 15111. Its prime factorization can be written as 3^2 × 23 × 73. 15111 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15111 is represented as 11101100000111 in binary and 3B07 in hexadecimal.

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

Factor Analysis

12 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum9
Digital Root9
Sum of Factors23088
Aliquot Sum7977
ClassificationDeficient
Prime Factors4
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3^2 × 23 × 73) reveals 4 prime building blocks.

Canonical form
3^2 × 23 × 73
332373
Divisibility Insights
  • Divisible by 2

    15111 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 9 is a multiple of 3.

  • Divisible by 4

    The last two digits 11 are not divisible by 4.

  • Divisible by 5

    15111 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 9 is a multiple of 9.

  • Divisible by 10

    15111 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15111 breaks down

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

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

Context

Where 15111 shows up

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

Is 15111 a prime number?

15111 is composite with 12 total factors and the prime factorization 3^2 × 23 × 73.

What is the prime factorization of 15111?

It breaks down as 3^2 × 23 × 73, multiplying the primes 3 × 3 × 23 × 73.

How is 15111 represented in binary and hexadecimal?

15111 converts to 11101100000111 in binary and 3B07 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 15111?

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