N
NumberPedia
Menu

© 2026 NumberPedia

Prime Number

55147

55147 is a odd prime number that follows 55146 and precedes 55148. As a prime number, 55147 is only divisible by 1 and itself. It holds a unique position in the sequence of integers. Its prime factorization is simply 55147. 55147 is classified as a deficient number based on the sum of its proper divisors. In computer science, 55147 is represented as 1101011101101011 in binary and D76B in hexadecimal.

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

Factor Analysis

2 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count5
Digit Sum22
Digital Root4
Sum of Factors55148
Aliquot Sum1
ClassificationDeficient
Prime Factors1
SequencesPrime numbers, Deficient numbers
Prime Factorization

55147 is prime, so its only factors are 1 and 55147.

Canonical form
55147
55147
Divisibility Insights
  • Divisible by 2

    55147 ends in 7, so it is odd.

  • Divisible by 3

    The digit sum 22 is not a multiple of 3.

  • Divisible by 4

    The last two digits 47 are not divisible by 4.

  • Divisible by 5

    55147 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 22 is not a multiple of 9.

  • Divisible by 10

    55147 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Prime numbersDeficient numbers
Advertisement

Deep dive

How 55147 breaks down

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

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

Context

Where 55147 shows up

Engineers lean on the divisibility profile when sizing circuits, mod designers use neighboring values (5514255152) to tune search ranges, and educators feature 55147 in worksheets about prime identification. 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 (Prime numbers, Deficient numbers) help historians, numerologists, and trivia writers tie 55147 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 55147

Is 55147 a prime number?

55147 is prime, meaning it is only divisible by 1 and itself.

What is the prime factorization of 55147?

55147 is already prime, so the factorization is simply 55147.

How is 55147 represented in binary and hexadecimal?

55147 converts to 1101011101101011 in binary and D76B in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 55147?

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