N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

15481

15481 is a odd composite number that follows 15480 and precedes 15482. It is composed of 4 distinct factors: 1, 113, 137, 15481. Its prime factorization can be written as 113 × 137. 15481 is classified as a deficient number based on the sum of its proper divisors. In computer science, 15481 is represented as 11110001111001 in binary and 3C79 in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
11110001111001
Base 2
Hexadecimal
3C79
Base 16

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum19
Digital Root1
Sum of Factors15732
Aliquot Sum251
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (113 × 137) reveals 2 prime building blocks.

Canonical form
113 × 137
113137
Divisibility Insights
  • Divisible by 2

    15481 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 19 is not a multiple of 3.

  • Divisible by 4

    The last two digits 81 are not divisible by 4.

  • Divisible by 5

    15481 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 19 is not a multiple of 9.

  • Divisible by 10

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 15481 breaks down

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

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

Context

Where 15481 shows up

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

Is 15481 a prime number?

15481 is composite with 4 total factors and the prime factorization 113 × 137.

What is the prime factorization of 15481?

It breaks down as 113 × 137, multiplying the primes 113 × 137.

How is 15481 represented in binary and hexadecimal?

15481 converts to 11110001111001 in binary and 3C79 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 15481?

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