The number 49483
49483 is a composite number with 4 divisors. Its prime factorisation is 7 × 7069. Divisors (4): 1, 7, 7069, 49483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49483: a semiprime: 7 × 7069, the product of two primes.
- 2
49483 is composite. Its prime factorisation is
- 3
The divisors add up to 56560; without 49483 itself that is 7077, so 49483 is deficient (7077 is less than 49483). Euler's totient φ(49483) = 42408 numbers up to 49483 share no factor with it.
- 4
The digits of 49483 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49483 = 7 \times 7069 \]
49483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56560 |
| Euler totient φ(n) | 42408 |
| Square | 2448567289 |
| Cube | 121162455161587 |
| Square root | 222.447747 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9483 × |
49483 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and eighty-three |
| Binary (base 2) | 1100000101001011 |
| Octal (base 8) | 140513 |
| Hexadecimal (base 16) | C14B |
| Base 3 | 2111212201 |
| As time | 49483 seconds = 13 h 44 min 43 s |
Is 49483 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 (49483 ÷ 7 = 7069) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49483 a prime number?
No. 49483 = 7 × 7069, so it is divisible by 7.
What are the factors of 49483?
1, 7, 7069, 49483.
What is 49483 in binary?
1100000101001011 (hexadecimal C14B, octal 140513).
What is the square root of 49483?
About 222.4477.
Is 49483 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49483?
49483 is a semiprime: 7 × 7069, the product of two primes.