The number 49063
49063 is a composite number with 8 divisors. Its prime factorisation is 7 × 43 × 163. Divisors (8): 1, 7, 43, 163, 301, 1141, 7009, 49063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49063 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49063 is composite. Its prime factorisation is
- 3
The divisors add up to 57728; without 49063 itself that is 8665, so 49063 is deficient (8665 is less than 49063). Euler's totient φ(49063) = 40824 numbers up to 49063 share no factor with it.
- 4
The digits of 49063 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49063 = 7 \times 43 \times 163 \]
49063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57728 |
| Euler totient φ(n) | 40824 |
| Square | 2407177969 |
| Cube | 118103372693047 |
| Square root | 221.501693 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9063 × |
49063 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty-three |
| Binary (base 2) | 1011111110100111 |
| Octal (base 8) | 137647 |
| Hexadecimal (base 16) | BFA7 |
| Base 3 | 2111022011 |
| As time | 49063 seconds = 13 h 37 min 43 s |
Is 49063 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | Yes (49063 ÷ 7 = 7009) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49063 a prime number?
No. 49063 = 7 × 43 × 163, so it is divisible by 7.
What are the factors of 49063?
1, 7, 43, 163, 301, 1141, 7009, 49063.
What is 49063 in binary?
1011111110100111 (hexadecimal BFA7, octal 137647).
What is the square root of 49063?
About 221.5017.
Is 49063 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49063?
It is a composite number with 8 divisors.