The number 31568
31568 is a composite number with 10 divisors. Its prime factorisation is × 1973. Divisors (10): 1, 2, 4, 8, 16, 1973, 3946, 7892, 15784, 31568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
31568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
31568 is composite. Its prime factorisation is
- 3
The divisors add up to 61194; without 31568 itself that is 29626, so 31568 is deficient (29626 is less than 31568). Euler's totient φ(31568) = 15776 numbers up to 31568 share no factor with it.
- 4
The digits of 31568 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31568 = 2^{4} \times 1973 \]31568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 61194 |
| Euler totient φ(n) | 15776 |
| Square | 996538624 |
| Cube | 31458731282432 |
| Square root | 177.673859 (= 4√1973) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 54 |
| Scientific notation | 3.1568 × |
31568 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand five hundred and sixty-eight |
| Binary (base 2) | 111101101010000 |
| Octal (base 8) | 75520 |
| Hexadecimal (base 16) | 7B50 |
| Base 3 | 1121022012 |
| As time | 31568 seconds = 8 h 46 min 8 s |
Is 31568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (31568 ÷ 2 = 15784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (31568 ÷ 4 = 7892) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | Yes (31568 ÷ 8 = 3946) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 31568 a prime number?
No. 31568 = × 1973, so it is divisible by 2.
What are the factors of 31568?
1, 2, 4, 8, 16, 1973, 3946, 7892, 15784, 31568.
What is 31568 in binary?
111101101010000 (hexadecimal 7B50, octal 75520).
What is the square root of 31568?
About 177.6739, exactly 4√1973.
Is 31568 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 31568?
It is a composite number with 10 divisors.