The number 39568
39568 is a composite number with 10 divisors. Its prime factorisation is × 2473. Divisors (10): 1, 2, 4, 8, 16, 2473, 4946, 9892, 19784, 39568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39568 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39568 is composite. Its prime factorisation is
- 3
The divisors add up to 76694; without 39568 itself that is 37126, so 39568 is deficient (37126 is less than 39568). Euler's totient φ(39568) = 19776 numbers up to 39568 share no factor with it.
- 4
The digits of 39568 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39568 = 2^{4} \times 2473 \]39568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 76694 |
| Euler totient φ(n) | 19776 |
| Square | 1565626624 |
| Cube | 61948714258432 |
| Square root | 198.917068 (= 4√2473) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 124 |
| Scientific notation | 3.9568 × |
39568 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand five hundred and sixty-eight |
| Binary (base 2) | 1001101010010000 |
| Octal (base 8) | 115220 |
| Hexadecimal (base 16) | 9A90 |
| Base 3 | 2000021111 |
| As time | 39568 seconds = 10 h 59 min 28 s |
Is 39568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39568 ÷ 2 = 19784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (39568 ÷ 4 = 9892) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (39568 ÷ 8 = 4946) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39568 a prime number?
No. 39568 = × 2473, so it is divisible by 2.
What are the factors of 39568?
1, 2, 4, 8, 16, 2473, 4946, 9892, 19784, 39568.
What is 39568 in binary?
1001101010010000 (hexadecimal 9A90, octal 115220).
What is the square root of 39568?
About 198.9171, exactly 4√2473.
Is 39568 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 39568?
It is a composite number with 10 divisors.