The number 39961
39961 is a composite number with 4 divisors. Its prime factorisation is 89 × 449. Divisors (4): 1, 89, 449, 39961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39961: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 89 × 449, the product of two primes.
- 2
39961 is composite. Its prime factorisation is
- 3
The divisors add up to 40500; without 39961 itself that is 539, so 39961 is deficient (539 is less than 39961). Euler's totient φ(39961) = 39424 numbers up to 39961 share no factor with it.
- 4
The digits of 39961 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39961 = 89 \times 449 \]
39961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 40500 |
| Euler totient φ(n) | 39424 |
| Square | 1596881521 |
| Cube | 63812982460681 |
| Square root | 199.902476 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.9961 × |
39961 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and sixty-one |
| Binary (base 2) | 1001110000011001 |
| Octal (base 8) | 116031 |
| Hexadecimal (base 16) | 9C19 |
| Base 3 | 2000211001 |
| As time | 39961 seconds = 11 h 6 min 1 s |
Is 39961 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 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 | No (remainder 1) | 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 | No (remainder 9) | 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 39961 a prime number?
No. 39961 = 89 × 449, so it is divisible by 89.
What are the factors of 39961?
1, 89, 449, 39961.
What is 39961 in binary?
1001110000011001 (hexadecimal 9C19, octal 116031).
What is the square root of 39961?
About 199.9025.
Is 39961 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 39961?
39961 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 89 × 449, the product of two primes.