The number 39649
39649 is a composite number with 4 divisors. Its prime factorisation is 31 × 1279. Divisors (4): 1, 31, 1279, 39649.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39649: a Harshad number: divisible by its digit sum 31; a semiprime: 31 × 1279, the product of two primes.
- 2
39649 is composite. Its prime factorisation is
- 3
The divisors add up to 40960; without 39649 itself that is 1311, so 39649 is deficient (1311 is less than 39649). Euler's totient φ(39649) = 38340 numbers up to 39649 share no factor with it.
- 4
The digits of 39649 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 168 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39649 = 31 \times 1279 \]
39649 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 40960 |
| Euler totient φ(n) | 38340 |
| Square | 1572043201 |
| Cube | 62329940876449 |
| Square root | 199.120566 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 168 |
| Scientific notation | 3.9649 × |
39649 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand six hundred and forty-nine |
| Binary (base 2) | 1001101011100001 |
| Octal (base 8) | 115341 |
| Hexadecimal (base 16) | 9AE1 |
| Base 3 | 2000101111 |
| As time | 39649 seconds = 11 h 0 min 49 s |
Is 39649 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 1) | 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 1) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39649 a prime number?
No. 39649 = 31 × 1279, so it is divisible by 31.
What are the factors of 39649?
1, 31, 1279, 39649.
What is 39649 in binary?
1001101011100001 (hexadecimal 9AE1, octal 115341).
What is the square root of 39649?
About 199.1206.
Is 39649 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 39649?
39649 is a Harshad number: divisible by its digit sum 31; a semiprime: 31 × 1279, the product of two primes.