The number 39481
39481 is a composite number with 4 divisors. Its prime factorisation is 13 × 3037. Divisors (4): 1, 13, 3037, 39481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39481: a semiprime: 13 × 3037, the product of two primes.
- 2
39481 is composite. Its prime factorisation is
- 3
The divisors add up to 42532; without 39481 itself that is 3051, so 39481 is deficient (3051 is less than 39481). Euler's totient φ(39481) = 36432 numbers up to 39481 share no factor with it.
- 4
The digits of 39481 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39481 = 13 \times 3037 \]
39481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42532 |
| Euler totient φ(n) | 36432 |
| Square | 1558749361 |
| Cube | 61540983521641 |
| Square root | 198.698264 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.9481 × |
39481 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand four hundred and eighty-one |
| Binary (base 2) | 1001101000111001 |
| Octal (base 8) | 115071 |
| Hexadecimal (base 16) | 9A39 |
| Base 3 | 2000011021 |
| As time | 39481 seconds = 10 h 58 min 1 s |
Is 39481 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 2) | 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 39481 a prime number?
No. 39481 = 13 × 3037, so it is divisible by 13.
What are the factors of 39481?
1, 13, 3037, 39481.
What is 39481 in binary?
1001101000111001 (hexadecimal 9A39, octal 115071).
What is the square root of 39481?
About 198.6983.
Is 39481 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 39481?
39481 is a semiprime: 13 × 3037, the product of two primes.