The number 39146
39146 is a composite number with 12 divisors. Its prime factorisation is 2 × × 37. Divisors (12): 1, 2, 23, 37, 46, 74, 529, 851, 1058, 1702, 19573, 39146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39146: a Harshad number: divisible by its digit sum 23.
- 2
39146 is composite. Its prime factorisation is
- 3
The divisors add up to 63042; without 39146 itself that is 23896, so 39146 is deficient (23896 is less than 39146). Euler's totient φ(39146) = 18216 numbers up to 39146 share no factor with it.
- 4
The digits of 39146 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39146 = 2 \times 23^{2} \times 37 \]39146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 63042 |
| Euler totient φ(n) | 18216 |
| Square | 1532409316 |
| Cube | 59987695084136 |
| Square root | 197.853481 (= 23√74) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9146 × |
39146 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand one hundred and forty-six |
| Binary (base 2) | 1001100011101010 |
| Octal (base 8) | 114352 |
| Hexadecimal (base 16) | 98EA |
| Base 3 | 1222200212 |
| As time | 39146 seconds = 10 h 52 min 26 s |
Is 39146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39146 ÷ 2 = 19573) | 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 | No (remainder 1) | 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 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 39146 a prime number?
No. 39146 = 2 × × 37, so it is divisible by 2.
What are the factors of 39146?
1, 2, 23, 37, 46, 74, 529, 851, 1058, 1702, 19573, 39146.
What is 39146 in binary?
1001100011101010 (hexadecimal 98EA, octal 114352).
What is the square root of 39146?
About 197.8535, exactly 23√74.
Is 39146 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 39146?
39146 is a Harshad number: divisible by its digit sum 23.