N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

63840

63840 is a even composite number that follows 63839 and precedes 63841. It is composed of 96 distinct factors: 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 19, 20, 21, 24, 28, 30, 32, 35, 38, 40, 42, 48, 56, 57, 60, 70, 76, 80, 84, 95, 96, 105, 112, 114, 120, 133, 140, 152, 160, 168, 190, 210, 224, 228, 240, 266, 280, 285, 304, 336, 380, 399, 420, 456, 480, 532, 560, 570, 608, 665, 672, 760, 798, 840, 912, 1064, 1120, 1140, 1330, 1520, 1596, 1680, 1824, 1995, 2128, 2280, 2660, 3040, 3192, 3360, 3990, 4256, 4560, 5320, 6384, 7980, 9120, 10640, 12768, 15960, 21280, 31920, 63840. Its prime factorization can be written as 2^5 × 3 × 5 × 7 × 19. 63840 is classified as a abundant number based on the sum of its proper divisors. In computer science, 63840 is represented as 1111100101100000 in binary and F960 in hexadecimal.

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

Factor Analysis

96 Factors

Properties

ParityEven
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum21
Digital Root3
Sum of Factors241920
Aliquot Sum178080
ClassificationAbundant
Prime Factors9
SequencesComposite numbers, Abundant numbers
Prime Factorization

The prime factorization (2^5 × 3 × 5 × 7 × 19) reveals 9 prime building blocks.

Canonical form
2^5 × 3 × 5 × 7 × 19
2222235719
Divisibility Insights
  • Divisible by 2

    63840 ends in 0, so it is even.

  • Divisible by 3

    The digit sum 21 is a multiple of 3.

  • Divisible by 4

    The last two digits 40 form a multiple of 4.

  • Divisible by 5

    63840 ends in 0, so it is divisible by 5.

  • Divisible by 6

    It meets the tests for both 2 and 3, so it is divisible by 6.

  • Divisible by 9

    The digit sum 21 is not a multiple of 9.

  • Divisible by 10

    63840 ends in 0.

  • Divisible by 11

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

Sequence Membership

Abundant classification and digit analytics place 63840 within several notable number theory sequences:

Composite numbersAbundant numbers
Advertisement

Deep dive

How 63840 breaks down

63840 carries 96 distinct factors and a digit signature of 21 (3 as the digital root). The abundant classification indicates that its proper divisors sum to 178080, which exceeds the number, offering a quick glimpse into its abundance profile.

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

Context

Where 63840 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (6383563845) to tune search ranges, and educators feature 63840 in worksheets about factor trees. Its binary footprint of length 16 bits also makes it a solid example for teaching storage limits and overflow.

Beyond STEM, the classification and sequence tags (Composite numbers, Abundant numbers) help historians, numerologists, and trivia writers tie 63840 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 63840

Is 63840 a prime number?

63840 is composite with 96 total factors and the prime factorization 2^5 × 3 × 5 × 7 × 19.

What is the prime factorization of 63840?

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

How is 63840 represented in binary and hexadecimal?

63840 converts to 1111100101100000 in binary and F960 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 63840?

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