N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

20027

20027 is a odd composite number that follows 20026 and precedes 20028. It is composed of 4 distinct factors: 1, 7, 2861, 20027. Its prime factorization can be written as 7 × 2861. 20027 is classified as a deficient number based on the sum of its proper divisors. In computer science, 20027 is represented as 100111000111011 in binary and 4E3B in hexadecimal.

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

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum11
Digital Root2
Sum of Factors22896
Aliquot Sum2869
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (7 × 2861) reveals 2 prime building blocks.

Canonical form
7 × 2861
72861
Divisibility Insights
  • Divisible by 2

    20027 ends in 7, so it is odd.

  • Divisible by 3

    The digit sum 11 is not a multiple of 3.

  • Divisible by 4

    The last two digits 27 are not divisible by 4.

  • Divisible by 5

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

  • Divisible by 10

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 20027 breaks down

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

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

Context

Where 20027 shows up

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

Is 20027 a prime number?

20027 is composite with 4 total factors and the prime factorization 7 × 2861.

What is the prime factorization of 20027?

It breaks down as 7 × 2861, multiplying the primes 7 × 2861.

How is 20027 represented in binary and hexadecimal?

20027 converts to 100111000111011 in binary and 4E3B in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 20027?

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