N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

20131

20131 is a odd composite number that follows 20130 and precedes 20132. It is composed of 4 distinct factors: 1, 41, 491, 20131. Its prime factorization can be written as 41 × 491. 20131 is classified as a deficient number based on the sum of its proper divisors. In computer science, 20131 is represented as 100111010100011 in binary and 4EA3 in hexadecimal.

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

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum7
Digital Root7
Sum of Factors20664
Aliquot Sum533
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (41 × 491) reveals 2 prime building blocks.

Canonical form
41 × 491
41491
Divisibility Insights
  • Divisible by 2

    20131 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 7 is not a multiple of 3.

  • Divisible by 4

    The last two digits 31 are not divisible by 4.

  • Divisible by 5

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

  • Divisible by 10

    20131 does not end in 0.

  • Divisible by 11

    The alternating digit sum 1 is not a multiple of 11.

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 20131 breaks down

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

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

Context

Where 20131 shows up

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

Is 20131 a prime number?

20131 is composite with 4 total factors and the prime factorization 41 × 491.

What is the prime factorization of 20131?

It breaks down as 41 × 491, multiplying the primes 41 × 491.

How is 20131 represented in binary and hexadecimal?

20131 converts to 100111010100011 in binary and 4EA3 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 20131?

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