The number 39050
39050 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 71. Divisors (24): 1, 2, 5, 10, 11, 22, 25, 50, 55, 71, 110, 142, 275, 355, 550, 710 … 39050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39050 is composite. Its prime factorisation is
- 3
The divisors add up to 80352; without 39050 itself that is 41302, so 39050 is abundant (41302 is more than 39050). Euler's totient φ(39050) = 14000 numbers up to 39050 share no factor with it.
- 4
The digits of 39050 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39050 = 2 \times 5^{2} \times 11 \times 71 \]39050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 80352 |
| Euler totient φ(n) | 14000 |
| Square | 1524902500 |
| Cube | 59547442625000 |
| Square root | 197.610728 (= 5√1562) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.905 × |
39050 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and fifty |
| Binary (base 2) | 1001100010001010 |
| Octal (base 8) | 114212 |
| Hexadecimal (base 16) | 988A |
| Base 3 | 1222120022 |
| As time | 39050 seconds = 10 h 50 min 50 s |
Is 39050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39050 ÷ 2 = 19525) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (39050 ÷ 5 = 7810) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 | Yes (39050 ÷ 10 = 3905) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (39050 ÷ 11 = 3550) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39050 a prime number?
No. 39050 = 2 × × 11 × 71, so it is divisible by 2.
What are the factors of 39050?
1, 2, 5, 10, 11, 22, 25, 50, 55, 71, 110, 142, 275, 355, 550, 710, 781, 1562, 1775, 3550, 3905, 7810, 19525, 39050.
What is 39050 in binary?
1001100010001010 (hexadecimal 988A, octal 114212).
What is the square root of 39050?
About 197.6107, exactly 5√1562.
Is 39050 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 39050?
It is a composite number with 24 divisors.