The number 39152
39152 is a composite number with 10 divisors. Its prime factorisation is × 2447. Divisors (10): 1, 2, 4, 8, 16, 2447, 4894, 9788, 19576, 39152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39152 is composite. Its prime factorisation is
- 3
The divisors add up to 75888; without 39152 itself that is 36736, so 39152 is deficient (36736 is less than 39152). Euler's totient φ(39152) = 19568 numbers up to 39152 share no factor with it.
- 4
The digits of 39152 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39152 = 2^{4} \times 2447 \]39152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 75888 |
| Euler totient φ(n) | 19568 |
| Square | 1532879104 |
| Cube | 60015282679808 |
| Square root | 197.868643 (= 4√2447) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9152 × |
39152 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand one hundred and fifty-two |
| Binary (base 2) | 1001100011110000 |
| Octal (base 8) | 114360 |
| Hexadecimal (base 16) | 98F0 |
| Base 3 | 1222201002 |
| As time | 39152 seconds = 10 h 52 min 32 s |
Is 39152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39152 ÷ 2 = 19576) | 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 (39152 ÷ 4 = 9788) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 1) | 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 (39152 ÷ 8 = 4894) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 39152 a prime number?
No. 39152 = × 2447, so it is divisible by 2.
What are the factors of 39152?
1, 2, 4, 8, 16, 2447, 4894, 9788, 19576, 39152.
What is 39152 in binary?
1001100011110000 (hexadecimal 98F0, octal 114360).
What is the square root of 39152?
About 197.8686, exactly 4√2447.
Is 39152 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 39152?
It is a composite number with 10 divisors.