N
NumberPedia
Menu

© 2026 NumberPedia

Prime Number

19991

19991 is a odd prime number that follows 19990 and precedes 19992. As a prime number, 19991 is only divisible by 1 and itself. It holds a unique position in the sequence of integers. Its prime factorization is simply 19991. 19991 is classified as a deficient number based on the sum of its proper divisors. In computer science, 19991 is represented as 100111000010111 in binary and 4E17 in hexadecimal.

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

Factor Analysis

2 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum29
Digital Root2
Sum of Factors19992
Aliquot Sum1
ClassificationDeficient
Prime Factors1
SequencesPrime numbers, Deficient numbers
Prime Factorization

19991 is prime, so its only factors are 1 and 19991.

Canonical form
19991
19991
Divisibility Insights
  • Divisible by 2

    19991 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 29 is not a multiple of 3.

  • Divisible by 4

    The last two digits 91 are not divisible by 4.

  • Divisible by 5

    19991 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 29 is not a multiple of 9.

  • Divisible by 10

    19991 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Prime numbersDeficient numbers
Advertisement

Deep dive

How 19991 breaks down

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

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

Context

Where 19991 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (19986–19996) to tune search ranges, and educators feature 19991 in worksheets about prime identification. 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 (Prime numbers, Deficient numbers) help historians, numerologists, and trivia writers tie 19991 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 19991

Is 19991 a prime number?

19991 is prime, meaning it is only divisible by 1 and itself.

What is the prime factorization of 19991?

19991 is already prime, so the factorization is simply 19991.

How is 19991 represented in binary and hexadecimal?

19991 converts to 100111000010111 in binary and 4E17 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 19991?

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