N
NumberPedia
Menu

© 2025 NumberPedia

Prime Number

947

947 is a odd prime number that follows 946 and precedes 948. As a prime number, 947 is only divisible by 1 and itself. It holds a unique position in the sequence of integers. Its prime factorization is simply 947. 947 is classified as a deficient number based on the sum of its proper divisors. In computer science, 947 is represented as 1110110011 in binary and 3B3 in hexadecimal. Historically, it is written as CMXLVII in Roman numerals.

Roman Numeral
CMXLVII
LatinClassic
Binary
1110110011
Base 2
Hexadecimal
3B3
Base 16

Factor Analysis

2 Factors

Properties

ParityOdd
Perfect SquareNo
Perfect CubeNo
Digit Count3
Digit Sum20
Digital Root2
Sum of Factors948
Aliquot Sum1
ClassificationDeficient
Prime Factors1
SequencesPrime numbers, Deficient numbers
Prime Factorization

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

Canonical form
947
947
Divisibility Insights
  • Divisible by 2

    947 ends in 7, so it is odd.

  • Divisible by 3

    The digit sum 20 is not a multiple of 3.

  • Divisible by 4

    The last two digits 47 are not divisible by 4.

  • Divisible by 5

    947 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

    947 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Prime numbersDeficient numbers
Advertisement

Deep dive

How 947 breaks down

947 carries 2 distinct factors and a digit signature of 20 (2 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 1110110011 supports bitwise reasoning, hexadecimal 3B3 aligns with computing notation, and the Roman numeral CMXLVII keeps the encyclopedic tradition alive. These attributes make 947 useful for math olympiad problems, puzzle design, and code challenges alike.

Context

Where 947 shows up

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

Is 947 a prime number?

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

What is the prime factorization of 947?

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

How is 947 represented in binary and hexadecimal?

947 converts to 1110110011 in binary and 3B3 in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 947?

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