The number 39460
39460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1973. Divisors (12): 1, 2, 4, 5, 10, 20, 1973, 3946, 7892, 9865, 19730, 39460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39460 is composite. Its prime factorisation is
- 3
The divisors add up to 82908; without 39460 itself that is 43448, so 39460 is abundant (43448 is more than 39460). Euler's totient φ(39460) = 15776 numbers up to 39460 share no factor with it.
- 4
The digits of 39460 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39460 = 2^{2} \times 5 \times 1973 \]39460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82908 |
| Euler totient φ(n) | 15776 |
| Square | 1557091600 |
| Cube | 61442834536000 |
| Square root | 198.645413 (= 2√9865) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 98 |
| Scientific notation | 3.946 × |
39460 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand four hundred and sixty |
| Binary (base 2) | 1001101000100100 |
| Octal (base 8) | 115044 |
| Hexadecimal (base 16) | 9A24 |
| Base 3 | 2000010111 |
| As time | 39460 seconds = 10 h 57 min 40 s |
Is 39460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39460 ÷ 2 = 19730) | 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 | Yes (39460 ÷ 4 = 9865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (39460 ÷ 5 = 7892) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (39460 ÷ 10 = 3946) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39460 a prime number?
No. 39460 = × 5 × 1973, so it is divisible by 2.
What are the factors of 39460?
1, 2, 4, 5, 10, 20, 1973, 3946, 7892, 9865, 19730, 39460.
What is 39460 in binary?
1001101000100100 (hexadecimal 9A24, octal 115044).
What is the square root of 39460?
About 198.6454, exactly 2√9865.
Is 39460 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 39460?
It is a composite number with 12 divisors.