The number 39052
39052 is a composite number with 12 divisors. Its prime factorisation is × 13 × 751. Divisors (12): 1, 2, 4, 13, 26, 52, 751, 1502, 3004, 9763, 19526, 39052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39052 is composite. Its prime factorisation is
- 3
The divisors add up to 73696; without 39052 itself that is 34644, so 39052 is deficient (34644 is less than 39052). Euler's totient φ(39052) = 18000 numbers up to 39052 share no factor with it.
- 4
The digits of 39052 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39052 = 2^{2} \times 13 \times 751 \]39052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73696 |
| Euler totient φ(n) | 18000 |
| Square | 1525058704 |
| Cube | 59556592508608 |
| Square root | 197.615789 (= 2√9763) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9052 × |
39052 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and fifty-two |
| Binary (base 2) | 1001100010001100 |
| Octal (base 8) | 114214 |
| Hexadecimal (base 16) | 988C |
| Base 3 | 1222120101 |
| As time | 39052 seconds = 10 h 50 min 52 s |
Is 39052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39052 ÷ 2 = 19526) | 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 (39052 ÷ 4 = 9763) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 2) | 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 39052 a prime number?
No. 39052 = × 13 × 751, so it is divisible by 2.
What are the factors of 39052?
1, 2, 4, 13, 26, 52, 751, 1502, 3004, 9763, 19526, 39052.
What is 39052 in binary?
1001100010001100 (hexadecimal 988C, octal 114214).
What is the square root of 39052?
About 197.6158, exactly 2√9763.
Is 39052 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 39052?
It is a composite number with 12 divisors.