N
NumberPedia
Menu

© 2025 NumberPedia

Composite Number

5487

5487 is a odd composite number that follows 5486 and precedes 5488. It is composed of 8 distinct factors: 1, 3, 31, 59, 93, 177, 1829, 5487. Its prime factorization can be written as 3 × 31 × 59. 5487 is classified as a deficient number based on the sum of its proper divisors. In computer science, 5487 is represented as 1010101101111 in binary and 156F in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
1010101101111
Base 2
Hexadecimal
156F
Base 16

Factor Analysis

8 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count4
Digit Sum24
Digital Root6
Sum of Factors7680
Aliquot Sum2193
ClassificationDeficient
Prime Factors3
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3 × 31 × 59) reveals 3 prime building blocks.

Canonical form
3 × 31 × 59
33159
Divisibility Insights
  • Divisible by 2

    5487 ends in 7, so it is odd.

  • Divisible by 3

    The digit sum 24 is a multiple of 3.

  • Divisible by 4

    The last two digits 87 are not divisible by 4.

  • Divisible by 5

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

  • Divisible by 10

    5487 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 5487 breaks down

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

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

Context

Where 5487 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (54825492) to tune search ranges, and educators feature 5487 in worksheets about factor trees. Its binary footprint of length 13 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 5487 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 5487

Is 5487 a prime number?

5487 is composite with 8 total factors and the prime factorization 3 × 31 × 59.

What is the prime factorization of 5487?

It breaks down as 3 × 31 × 59, multiplying the primes 3 × 31 × 59.

How is 5487 represented in binary and hexadecimal?

5487 converts to 1010101101111 in binary and 156F in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 5487?

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