The number 39464
39464 is a composite number with 8 divisors. Its prime factorisation is × 4933. Divisors (8): 1, 2, 4, 8, 4933, 9866, 19732, 39464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39464 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39464 is composite. Its prime factorisation is
- 3
The divisors add up to 74010; without 39464 itself that is 34546, so 39464 is deficient (34546 is less than 39464). Euler's totient φ(39464) = 19728 numbers up to 39464 share no factor with it.
- 4
The digits of 39464 add up to 26, 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
\[ 39464 = 2^{3} \times 4933 \]39464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74010 |
| Euler totient φ(n) | 19728 |
| Square | 1557407296 |
| Cube | 61461521529344 |
| Square root | 198.655481 (= 2√9866) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9464 × |
39464 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand four hundred and sixty-four |
| Binary (base 2) | 1001101000101000 |
| Octal (base 8) | 115050 |
| Hexadecimal (base 16) | 9A28 |
| Base 3 | 2000010122 |
| As time | 39464 seconds = 10 h 57 min 44 s |
Is 39464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39464 ÷ 2 = 19732) | 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 | Yes (39464 ÷ 4 = 9866) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 5) | 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 | Yes (39464 ÷ 8 = 4933) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39464 a prime number?
No. 39464 = × 4933, so it is divisible by 2.
What are the factors of 39464?
1, 2, 4, 8, 4933, 9866, 19732, 39464.
What is 39464 in binary?
1001101000101000 (hexadecimal 9A28, octal 115050).
What is the square root of 39464?
About 198.6555, exactly 2√9866.
Is 39464 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 39464?
It is a composite number with 8 divisors.