N
NumberPedia
Menu

© 2025 NumberPedia

Composite Number

143

143 is a odd composite number that follows 142 and precedes 144. It is composed of 4 distinct factors: 1, 11, 13, 143. Its prime factorization can be written as 11 × 13. 143 is classified as a deficient number based on the sum of its proper divisors. In computer science, 143 is represented as 10001111 in binary and 8F in hexadecimal. Historically, it is written as CXLIII in Roman numerals.

Roman Numeral
CXLIII
LatinClassic
Binary
10001111
Base 2
Hexadecimal
8F
Base 16

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count3
Digit Sum8
Digital Root8
Sum of Factors168
Aliquot Sum25
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (11 × 13) reveals 2 prime building blocks.

Canonical form
11 × 13
1113
Divisibility Insights
  • Divisible by 2

    143 ends in 3, so it is odd.

  • Divisible by 3

    The digit sum 8 is not a multiple of 3.

  • Divisible by 4

    The last two digits 43 are not divisible by 4.

  • Divisible by 5

    143 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 8 is not a multiple of 9.

  • Divisible by 10

    143 does not end in 0.

  • Divisible by 11

    The alternating digit sum 0 is a multiple of 11.

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 143 breaks down

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

Numeral conversions provide additional context: the binary form 10001111 supports bitwise reasoning, hexadecimal 8F aligns with computing notation, and the Roman numeral CXLIII keeps the encyclopedic tradition alive. These attributes make 143 useful for math olympiad problems, puzzle design, and code challenges alike.

Context

Where 143 shows up

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

Is 143 a prime number?

143 is composite with 4 total factors and the prime factorization 11 × 13.

What is the prime factorization of 143?

It breaks down as 11 × 13, multiplying the primes 11 × 13.

How is 143 represented in binary and hexadecimal?

143 converts to 10001111 in binary and 8F in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 143?

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