The number 49649
49649 is a composite number with 4 divisors. Its prime factorisation is 131 × 379. Divisors (4): 1, 131, 379, 49649.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49649: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 131 × 379, the product of two primes.
- 2
49649 is composite. Its prime factorisation is
- 3
The divisors add up to 50160; without 49649 itself that is 511, so 49649 is deficient (511 is less than 49649). Euler's totient φ(49649) = 49140 numbers up to 49649 share no factor with it.
- 4
The digits of 49649 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49649 = 131 \times 379 \]
49649 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50160 |
| Euler totient φ(n) | 49140 |
| Square | 2465023201 |
| Cube | 122385936906449 |
| Square root | 222.820556 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9649 × |
49649 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and forty-nine |
| Binary (base 2) | 1100000111110001 |
| Octal (base 8) | 140761 |
| Hexadecimal (base 16) | C1F1 |
| Base 3 | 2112002212 |
| As time | 49649 seconds = 13 h 47 min 29 s |
Is 49649 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 2) | 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 5) | 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 | No (remainder 1) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49649 a prime number?
No. 49649 = 131 × 379, so it is divisible by 131.
What are the factors of 49649?
1, 131, 379, 49649.
What is 49649 in binary?
1100000111110001 (hexadecimal C1F1, octal 140761).
What is the square root of 49649?
About 222.8206.
Is 49649 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49649?
49649 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 131 × 379, the product of two primes.