N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

32565

32565 is a odd composite number that follows 32564 and precedes 32566. It is composed of 16 distinct factors: 1, 3, 5, 13, 15, 39, 65, 167, 195, 501, 835, 2171, 2505, 6513, 10855, 32565. Its prime factorization can be written as 3 × 5 × 13 × 167. 32565 is classified as a deficient number based on the sum of its proper divisors. In computer science, 32565 is represented as 111111100110101 in binary and 7F35 in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
111111100110101
Base 2
Hexadecimal
7F35
Base 16

Factor Analysis

16 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum21
Digital Root3
Sum of Factors56448
Aliquot Sum23883
ClassificationDeficient
Prime Factors4
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3 × 5 × 13 × 167) reveals 4 prime building blocks.

Canonical form
3 × 5 × 13 × 167
3513167
Divisibility Insights
  • Divisible by 2

    32565 ends in 5, so it is odd.

  • Divisible by 3

    The digit sum 21 is a multiple of 3.

  • Divisible by 4

    The last two digits 65 are not divisible by 4.

  • Divisible by 5

    32565 ends in 5, so it is divisible by 5.

  • Divisible by 6

    A number must be divisible by 2 and 3 to pass the 6-test.

  • Divisible by 9

    The digit sum 21 is not a multiple of 9.

  • Divisible by 10

    32565 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 32565 within several notable number theory sequences:

Composite numbersDeficient numbers
Advertisement

Deep dive

How 32565 breaks down

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

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

Context

Where 32565 shows up

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

Is 32565 a prime number?

32565 is composite with 16 total factors and the prime factorization 3 × 5 × 13 × 167.

What is the prime factorization of 32565?

It breaks down as 3 × 5 × 13 × 167, multiplying the primes 3 × 5 × 13 × 167.

How is 32565 represented in binary and hexadecimal?

32565 converts to 111111100110101 in binary and 7F35 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 32565?

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