The number 49487
49487 is a composite number with 8 divisors. Its prime factorisation is 17 × 41 × 71. Divisors (8): 1, 17, 41, 71, 697, 1207, 2911, 49487.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49487: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49487 is composite. Its prime factorisation is
- 3
The divisors add up to 54432; without 49487 itself that is 4945, so 49487 is deficient (4945 is less than 49487). Euler's totient φ(49487) = 44800 numbers up to 49487 share no factor with it.
- 4
The digits of 49487 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49487 = 17 \times 41 \times 71 \]
49487 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54432 |
| Euler totient φ(n) | 44800 |
| Square | 2448963169 |
| Cube | 121191840344303 |
| Square root | 222.456737 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9487 × |
49487 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and eighty-seven |
| Binary (base 2) | 1100000101001111 |
| Octal (base 8) | 140517 |
| Hexadecimal (base 16) | C14F |
| Base 3 | 2111212212 |
| As time | 49487 seconds = 13 h 44 min 47 s |
Is 49487 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 4) | 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49487 a prime number?
No. 49487 = 17 × 41 × 71, so it is divisible by 17.
What are the factors of 49487?
1, 17, 41, 71, 697, 1207, 2911, 49487.
What is 49487 in binary?
1100000101001111 (hexadecimal C14F, octal 140517).
What is the square root of 49487?
About 222.4567.
Is 49487 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49487?
49487 is a happy number: repeatedly adding the squares of its digits reaches 1.