N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

20007

20007 is a odd composite number that follows 20006 and precedes 20008. It is composed of 20 distinct factors: 1, 3, 9, 13, 19, 27, 39, 57, 81, 117, 171, 247, 351, 513, 741, 1053, 1539, 2223, 6669, 20007. Its prime factorization can be written as 3^4 × 13 × 19. 20007 is classified as a deficient number based on the sum of its proper divisors. In computer science, 20007 is represented as 100111000100111 in binary and 4E27 in hexadecimal.

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

Factor Analysis

20 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum9
Digital Root9
Sum of Factors33880
Aliquot Sum13873
ClassificationDeficient
Prime Factors6
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3^4 × 13 × 19) reveals 6 prime building blocks.

Canonical form
3^4 × 13 × 19
33331319
Divisibility Insights
  • Divisible by 2

    20007 ends in 7, so it is odd.

  • Divisible by 3

    The digit sum 9 is a multiple of 3.

  • Divisible by 4

    The last two digits 07 are not divisible by 4.

  • Divisible by 5

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

  • Divisible by 10

    20007 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 20007 breaks down

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

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

Context

Where 20007 shows up

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

Is 20007 a prime number?

20007 is composite with 20 total factors and the prime factorization 3^4 × 13 × 19.

What is the prime factorization of 20007?

It breaks down as 3^4 × 13 × 19, multiplying the primes 3 × 3 × 3 × 3 × 13 × 19.

How is 20007 represented in binary and hexadecimal?

20007 converts to 100111000100111 in binary and 4E27 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 20007?

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