N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

20025

20025 is a odd composite number that follows 20024 and precedes 20026. It is composed of 18 distinct factors: 1, 3, 5, 9, 15, 25, 45, 75, 89, 225, 267, 445, 801, 1335, 2225, 4005, 6675, 20025. Its prime factorization can be written as 3^2 × 5^2 × 89. 20025 is classified as a deficient number based on the sum of its proper divisors. In computer science, 20025 is represented as 100111000111001 in binary and 4E39 in hexadecimal.

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

Factor Analysis

18 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum9
Digital Root9
Sum of Factors36270
Aliquot Sum16245
ClassificationDeficient
Prime Factors5
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3^2 × 5^2 × 89) reveals 5 prime building blocks.

Canonical form
3^2 × 5^2 × 89
335589
Divisibility Insights
  • Divisible by 2

    20025 ends in 5, so it is odd.

  • Divisible by 3

    The digit sum 9 is a multiple of 3.

  • Divisible by 4

    The last two digits 25 are not divisible by 4.

  • Divisible by 5

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

  • Divisible by 10

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 20025 breaks down

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

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

Context

Where 20025 shows up

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

Is 20025 a prime number?

20025 is composite with 18 total factors and the prime factorization 3^2 × 5^2 × 89.

What is the prime factorization of 20025?

It breaks down as 3^2 × 5^2 × 89, multiplying the primes 3 × 3 × 5 × 5 × 89.

How is 20025 represented in binary and hexadecimal?

20025 converts to 100111000111001 in binary and 4E39 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 20025?

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