N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

10961

10961 is a odd composite number that follows 10960 and precedes 10962. It is composed of 4 distinct factors: 1, 97, 113, 10961. Its prime factorization can be written as 97 × 113. 10961 is classified as a deficient number based on the sum of its proper divisors. In computer science, 10961 is represented as 10101011010001 in binary and 2AD1 in hexadecimal.

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

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum17
Digital Root8
Sum of Factors11172
Aliquot Sum211
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (97 × 113) reveals 2 prime building blocks.

Canonical form
97 × 113
97113
Divisibility Insights
  • Divisible by 2

    10961 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 17 is not a multiple of 3.

  • Divisible by 4

    The last two digits 61 are not divisible by 4.

  • Divisible by 5

    10961 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 17 is not a multiple of 9.

  • Divisible by 10

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 10961 breaks down

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

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

Context

Where 10961 shows up

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

Is 10961 a prime number?

10961 is composite with 4 total factors and the prime factorization 97 × 113.

What is the prime factorization of 10961?

It breaks down as 97 × 113, multiplying the primes 97 × 113.

How is 10961 represented in binary and hexadecimal?

10961 converts to 10101011010001 in binary and 2AD1 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 10961?

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