N
NumberPedia
Menu

© 2025 NumberPedia

Composite Number

393

393 is a odd composite number that follows 392 and precedes 394. It is composed of 4 distinct factors: 1, 3, 131, 393. Its prime factorization can be written as 3 × 131. 393 is classified as a deficient number based on the sum of its proper divisors. In computer science, 393 is represented as 110001001 in binary and 189 in hexadecimal. Historically, it is written as CCCXCIII in Roman numerals.

Roman Numeral
CCCXCIII
LatinClassic
Binary
110001001
Base 2
Hexadecimal
189
Base 16

Factor Analysis

4 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count3
Digit Sum15
Digital Root6
Sum of Factors528
Aliquot Sum135
ClassificationDeficient
Prime Factors2
SequencesComposite numbers, Deficient numbers
Prime Factorization

The prime factorization (3 × 131) reveals 2 prime building blocks.

Canonical form
3 × 131
3131
Divisibility Insights
  • Divisible by 2

    393 ends in 3, so it is odd.

  • Divisible by 3

    The digit sum 15 is a multiple of 3.

  • Divisible by 4

    The last two digits 93 are not divisible by 4.

  • Divisible by 5

    393 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 15 is not a multiple of 9.

  • Divisible by 10

    393 does not end in 0.

  • Divisible by 11

    The alternating digit sum -3 is not a multiple of 11.

Sequence Membership

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

Composite numbersDeficient numbers
Advertisement

Deep dive

How 393 breaks down

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

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

Context

Where 393 shows up

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

Is 393 a prime number?

393 is composite with 4 total factors and the prime factorization 3 × 131.

What is the prime factorization of 393?

It breaks down as 3 × 131, multiplying the primes 3 × 131.

How is 393 represented in binary and hexadecimal?

393 converts to 110001001 in binary and 189 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 393?

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