N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

80461

80461 is a odd composite number that follows 80460 and precedes 80462. It is composed of 4 distinct factors: 1, 17, 4733, 80461. Its prime factorization can be written as 17 × 4733. 80461 is classified as a deficient number based on the sum of its proper divisors. In computer science, 80461 is represented as 10011101001001101 in binary and 13A4D in hexadecimal.

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
10011101001001101
Base 2
Hexadecimal
13A4D
Base 16

Factor Analysis

4 Factors

Properties

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

The prime factorization (17 × 4733) reveals 2 prime building blocks.

Canonical form
17 × 4733
174733
Divisibility Insights
  • Divisible by 2

    80461 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 61 are not divisible by 4.

  • Divisible by 5

    80461 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

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 80461 breaks down

80461 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 4751, which stays below the number, offering a quick glimpse into its abundance profile.

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

Context

Where 80461 shows up

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

Is 80461 a prime number?

80461 is composite with 4 total factors and the prime factorization 17 × 4733.

What is the prime factorization of 80461?

It breaks down as 17 × 4733, multiplying the primes 17 × 4733.

How is 80461 represented in binary and hexadecimal?

80461 converts to 10011101001001101 in binary and 13A4D in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 80461?

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