The number 39150
39150 is a composite number with 48 divisors. Its prime factorisation is 2 × × × 29. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 29, 30, 45, 50, 54 … 39150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39150: a Harshad number: divisible by its digit sum 18.
- 2
39150 is composite. Its prime factorisation is
- 3
The divisors add up to 111600; without 39150 itself that is 72450, so 39150 is abundant (72450 is more than 39150). Euler's totient φ(39150) = 10080 numbers up to 39150 share no factor with it.
- 4
The digits of 39150 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 199 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39150 = 2 \times 3^{3} \times 5^{2} \times 29 \]39150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 111600 |
| Euler totient φ(n) | 10080 |
| Square | 1532722500 |
| Cube | 60006085875000 |
| Square root | 197.863589 (= 15√174) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 199 |
| Scientific notation | 3.915 × |
39150 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand one hundred and fifty |
| Binary (base 2) | 1001100011101110 |
| Octal (base 8) | 114356 |
| Hexadecimal (base 16) | 98EE |
| Base 3 | 1222201000 |
| As time | 39150 seconds = 10 h 52 min 30 s |
Is 39150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39150 ÷ 2 = 19575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (39150 ÷ 3 = 13050) | 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 (39150 ÷ 5 = 7830) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (39150 ÷ 6 = 6525) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (39150 ÷ 9 = 4350) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (39150 ÷ 10 = 3915) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39150 a prime number?
No. 39150 = 2 × × × 29, so it is divisible by 2.
What are the factors of 39150?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 29, 30, 45, 50, 54, 58, 75, 87, 90, 135, 145, 150, 174, 225, 261, 270, 290, 435, 450, 522, 675, 725, 783, 870, 1305, 1350, 1450, 1566, 2175, 2610, 3915, 4350, 6525, 7830, 13050, 19575, 39150.
What is 39150 in binary?
1001100011101110 (hexadecimal 98EE, octal 114356).
What is the square root of 39150?
About 197.8636, exactly 15√174.
Is 39150 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 39150?
39150 is a Harshad number: divisible by its digit sum 18.