The number 49153
49153 is a composite number with 8 divisors. Its prime factorisation is 13 × 19 × 199. Divisors (8): 1, 13, 19, 199, 247, 2587, 3781, 49153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49153 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49153 is composite. Its prime factorisation is
- 3
The divisors add up to 56000; without 49153 itself that is 6847, so 49153 is deficient (6847 is less than 49153). Euler's totient φ(49153) = 42768 numbers up to 49153 share no factor with it.
- 4
The digits of 49153 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49153 = 13 \times 19 \times 199 \]
49153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56000 |
| Euler totient φ(n) | 42768 |
| Square | 2416017409 |
| Cube | 118754503704577 |
| Square root | 221.704759 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9153 × |
49153 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and fifty-three |
| Binary (base 2) | 1100000000000001 |
| Octal (base 8) | 140001 |
| Hexadecimal (base 16) | C001 |
| Base 3 | 2111102111 |
| As time | 49153 seconds = 13 h 39 min 13 s |
Is 49153 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 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 | No (remainder 6) | 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 3) | 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 49153 a prime number?
No. 49153 = 13 × 19 × 199, so it is divisible by 13.
What are the factors of 49153?
1, 13, 19, 199, 247, 2587, 3781, 49153.
What is 49153 in binary?
1100000000000001 (hexadecimal C001, octal 140001).
What is the square root of 49153?
About 221.7048.
Is 49153 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49153?
It is a composite number with 8 divisors.