N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

65291

65291 is a odd composite number that follows 65290 and precedes 65292. It is composed of 4 distinct factors: 1, 109, 599, 65291. Its prime factorization can be written as 109 × 599. 65291 is classified as a deficient number based on the sum of its proper divisors. In computer science, 65291 is represented as 1111111100001011 in binary and FF0B in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
1111111100001011
Base 2
Hexadecimal
FF0B
Base 16

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum23
Digital Root5
Sum of Factors66000
Aliquot Sum709
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (109 × 599) reveals 2 prime building blocks.

Canonical form
109 × 599
109599
Divisibility Insights
  • Divisible by 2

    65291 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 23 is not a multiple of 3.

  • Divisible by 4

    The last two digits 91 are not divisible by 4.

  • Divisible by 5

    65291 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 23 is not a multiple of 9.

  • Divisible by 10

    65291 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 65291 breaks down

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

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

Context

Where 65291 shows up

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

Is 65291 a prime number?

65291 is composite with 4 total factors and the prime factorization 109 × 599.

What is the prime factorization of 65291?

It breaks down as 109 × 599, multiplying the primes 109 × 599.

How is 65291 represented in binary and hexadecimal?

65291 converts to 1111111100001011 in binary and FF0B in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 65291?

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