N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

19491

19491 is a odd composite number that follows 19490 and precedes 19492. It is composed of 8 distinct factors: 1, 3, 73, 89, 219, 267, 6497, 19491. Its prime factorization can be written as 3 × 73 × 89. 19491 is classified as a deficient number based on the sum of its proper divisors. In computer science, 19491 is represented as 100110000100011 in binary and 4C23 in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
100110000100011
Base 2
Hexadecimal
4C23
Base 16

Factor Analysis

8 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum24
Digital Root6
Sum of Factors26640
Aliquot Sum7149
ClassificationDeficient
Prime Factors3
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3 × 73 × 89) reveals 3 prime building blocks.

Canonical form
3 × 73 × 89
37389
Divisibility Insights
  • Divisible by 2

    19491 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 24 is a multiple of 3.

  • Divisible by 4

    The last two digits 91 are not divisible by 4.

  • Divisible by 5

    19491 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 24 is not a multiple of 9.

  • Divisible by 10

    19491 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 19491 breaks down

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

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

Context

Where 19491 shows up

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

Is 19491 a prime number?

19491 is composite with 8 total factors and the prime factorization 3 × 73 × 89.

What is the prime factorization of 19491?

It breaks down as 3 × 73 × 89, multiplying the primes 3 × 73 × 89.

How is 19491 represented in binary and hexadecimal?

19491 converts to 100110000100011 in binary and 4C23 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 19491?

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