The number 39131
39131 is a composite number with 4 divisors. Its prime factorisation is 109 × 359. Divisors (4): 1, 109, 359, 39131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39131: a semiprime: 109 × 359, the product of two primes.
- 2
39131 is composite. Its prime factorisation is
- 3
The divisors add up to 39600; without 39131 itself that is 469, so 39131 is deficient (469 is less than 39131). Euler's totient φ(39131) = 38664 numbers up to 39131 share no factor with it.
- 4
The digits of 39131 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 80 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39131 = 109 \times 359 \]
39131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 39600 |
| Euler totient φ(n) | 38664 |
| Square | 1531235161 |
| Cube | 59918763085091 |
| Square root | 197.815571 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 80 |
| Scientific notation | 3.9131 × |
39131 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand one hundred and thirty-one |
| Binary (base 2) | 1001100011011011 |
| Octal (base 8) | 114333 |
| Hexadecimal (base 16) | 98DB |
| Base 3 | 1222200022 |
| As time | 39131 seconds = 10 h 52 min 11 s |
Is 39131 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39131 a prime number?
No. 39131 = 109 × 359, so it is divisible by 109.
What are the factors of 39131?
1, 109, 359, 39131.
What is 39131 in binary?
1001100011011011 (hexadecimal 98DB, octal 114333).
What is the square root of 39131?
About 197.8156.
Is 39131 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 39131?
39131 is a semiprime: 109 × 359, the product of two primes.