N
NumberPedia
Menu

© 2026 NumberPedia

Composite Number

81461

81461 is a odd composite number that follows 81460 and precedes 81462. It is composed of 6 distinct factors: 1, 29, 53, 1537, 2809, 81461. Its prime factorization can be written as 29 × 53^2. 81461 is classified as a deficient number based on the sum of its proper divisors. In computer science, 81461 is represented as 10011111000110101 in binary and 13E35 in hexadecimal.

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

Factor Analysis

6 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum20
Digital Root2
Sum of Factors85890
Aliquot Sum4429
ClassificationDeficient
Prime Factors3
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (29 × 53^2) reveals 3 prime building blocks.

Canonical form
29 × 53^2
295353
Divisibility Insights
  • Divisible by 2

    81461 ends in 1, so it is odd.

  • Divisible by 3

    The digit sum 20 is not a multiple of 3.

  • Divisible by 4

    The last two digits 61 are not divisible by 4.

  • Divisible by 5

    81461 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 20 is not a multiple of 9.

  • Divisible by 10

    81461 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 81461 breaks down

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

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

Context

Where 81461 shows up

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

Is 81461 a prime number?

81461 is composite with 6 total factors and the prime factorization 29 × 53^2.

What is the prime factorization of 81461?

It breaks down as 29 × 53^2, multiplying the primes 29 × 53 × 53.

How is 81461 represented in binary and hexadecimal?

81461 converts to 10011111000110101 in binary and 13E35 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 81461?

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