N
NumberPedia
Menu

© 2026 NumberPedia

Prime Number

31567

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

Roman Numeral
N/A (1-3999)
LatinClassic
Binary
111101101001111
Base 2
Hexadecimal
7B4F
Base 16

Factor Analysis

2 Factors

Properties

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

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

Canonical form
31567
31567
Divisibility Insights
  • Divisible by 2

    31567 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 67 are not divisible by 4.

  • Divisible by 5

    31567 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

    31567 does not end in 0.

  • Divisible by 11

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

Sequence Membership

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

Prime numbersDeficient numbers
Advertisement

Deep dive

How 31567 breaks down

31567 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 111101101001111 supports bitwise reasoning, hexadecimal 7B4F aligns with computing notation, and the Roman numeral N/A (1-3999) keeps the encyclopedic tradition alive. These attributes make 31567 useful for math olympiad problems, puzzle design, and code challenges alike.

Context

Where 31567 shows up

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

Is 31567 a prime number?

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

What is the prime factorization of 31567?

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

How is 31567 represented in binary and hexadecimal?

31567 converts to 111101101001111 in binary and 7B4F in hexadecimal, which are helpful for computer science applications.

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

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

What are the digit sum and digital root of 31567?

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