N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15491

15491 is a odd composite number that follows 15490 and precedes 15492. It is composed of 4 distinct factors: 1, 7, 2213, 15491. Its prime factorization can be written as 7 × 2213. 15491 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15491 is represented as 11110010000011 in binary and 3C83 in hexadecimal.

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

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum20
Digital Root2
Sum of Factors17712
Aliquot Sum2221
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (7 × 2213) reveals 2 prime building blocks.

Canonical form
7 × 2213
72213
Divisibility Insights
  • Divisible by 2

    15491 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 20 is not a multiple of 3.

  • Divisible by 4

    The last two digits 91 are not divisible by 4.

  • Divisible by 5

    15491 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 20 is not a multiple of 9.

  • Divisible by 10

    15491 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15491 breaks down

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

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

Context

Where 15491 shows up

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

Is 15491 a prime number?

15491 is composite with 4 total factors and the prime factorization 7 × 2213.

What is the prime factorization of 15491?

It breaks down as 7 × 2213, multiplying the primes 7 × 2213.

How is 15491 represented in binary and hexadecimal?

15491 converts to 11110010000011 in binary and 3C83 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 15491?

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