The number 48933
48933 is a composite number with 6 divisors. Its prime factorisation is × 5437. Divisors (6): 1, 3, 9, 5437, 16311, 48933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48933 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48933 is composite. Its prime factorisation is
- 3
The divisors add up to 70694; without 48933 itself that is 21761, so 48933 is deficient (21761 is less than 48933). Euler's totient φ(48933) = 32616 numbers up to 48933 share no factor with it.
- 4
The digits of 48933 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48933 = 3^{2} \times 5437 \]48933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 70694 |
| Euler totient φ(n) | 32616 |
| Square | 2394438489 |
| Cube | 117167058582237 |
| Square root | 221.208047 (= 3√5437) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8933 × |
48933 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-three |
| Binary (base 2) | 1011111100100101 |
| Octal (base 8) | 137445 |
| Hexadecimal (base 16) | BF25 |
| Base 3 | 2111010100 |
| As time | 48933 seconds = 13 h 35 min 33 s |
Is 48933 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 | Yes (48933 ÷ 3 = 16311) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48933 ÷ 9 = 5437) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48933 a prime number?
No. 48933 = × 5437, so it is divisible by 3.
What are the factors of 48933?
1, 3, 9, 5437, 16311, 48933.
What is 48933 in binary?
1011111100100101 (hexadecimal BF25, octal 137445).
What is the square root of 48933?
About 221.2080, exactly 3√5437.
Is 48933 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48933?
It is a composite number with 6 divisors.