The number 48983
48983 is a composite number with 8 divisors. Its prime factorisation is 11 × 61 × 73. Divisors (8): 1, 11, 61, 73, 671, 803, 4453, 48983.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48983 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48983 is composite. Its prime factorisation is
- 3
The divisors add up to 55056; without 48983 itself that is 6073, so 48983 is deficient (6073 is less than 48983). Euler's totient φ(48983) = 43200 numbers up to 48983 share no factor with it.
- 4
The digits of 48983 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48983 = 11 \times 61 \times 73 \]
48983 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55056 |
| Euler totient φ(n) | 43200 |
| Square | 2399334289 |
| Cube | 117526591478087 |
| Square root | 221.321034 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8983 × |
48983 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and eighty-three |
| Binary (base 2) | 1011111101010111 |
| Octal (base 8) | 137527 |
| Hexadecimal (base 16) | BF57 |
| Base 3 | 2111012012 |
| As time | 48983 seconds = 13 h 36 min 23 s |
Is 48983 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48983 ÷ 11 = 4453) | 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 48983 a prime number?
No. 48983 = 11 × 61 × 73, so it is divisible by 11.
What are the factors of 48983?
1, 11, 61, 73, 671, 803, 4453, 48983.
What is 48983 in binary?
1011111101010111 (hexadecimal BF57, octal 137527).
What is the square root of 48983?
About 221.3210.
Is 48983 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 48983?
It is a composite number with 8 divisors.