The number 39061
39061 is a composite number with 8 divisors. Its prime factorisation is 11 × 53 × 67. Divisors (8): 1, 11, 53, 67, 583, 737, 3551, 39061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39061 is composite. Its prime factorisation is
- 3
The divisors add up to 44064; without 39061 itself that is 5003, so 39061 is deficient (5003 is less than 39061). Euler's totient φ(39061) = 34320 numbers up to 39061 share no factor with it.
- 4
The digits of 39061 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39061 = 11 \times 53 \times 67 \]
39061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 44064 |
| Euler totient φ(n) | 34320 |
| Square | 1525761721 |
| Cube | 59597778583981 |
| Square root | 197.638559 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.9061 × |
39061 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and sixty-one |
| Binary (base 2) | 1001100010010101 |
| Octal (base 8) | 114225 |
| Hexadecimal (base 16) | 9895 |
| Base 3 | 1222120201 |
| As time | 39061 seconds = 10 h 51 min 1 s |
Is 39061 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 | No (remainder 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (39061 ÷ 11 = 3551) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39061 a prime number?
No. 39061 = 11 × 53 × 67, so it is divisible by 11.
What are the factors of 39061?
1, 11, 53, 67, 583, 737, 3551, 39061.
What is 39061 in binary?
1001100010010101 (hexadecimal 9895, octal 114225).
What is the square root of 39061?
About 197.6386.
Is 39061 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 39061?
It is a composite number with 8 divisors.