The number 49383
49383 is a composite number with 16 divisors. Its prime factorisation is × 31 × 59. Divisors (16): 1, 3, 9, 27, 31, 59, 93, 177, 279, 531, 837, 1593, 1829, 5487, 16461, 49383.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49383: a Harshad number: divisible by its digit sum 27.
- 2
49383 is composite. Its prime factorisation is
- 3
The divisors add up to 76800; without 49383 itself that is 27417, so 49383 is deficient (27417 is less than 49383). Euler's totient φ(49383) = 31320 numbers up to 49383 share no factor with it.
- 4
The digits of 49383 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49383 = 3^{3} \times 31 \times 59 \]49383 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 76800 |
| Euler totient φ(n) | 31320 |
| Square | 2438680689 |
| Cube | 120429368464887 |
| Square root | 222.222861 (= 3√5487) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9383 × |
49383 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and eighty-three |
| Binary (base 2) | 1100000011100111 |
| Octal (base 8) | 140347 |
| Hexadecimal (base 16) | C0E7 |
| Base 3 | 2111202000 |
| As time | 49383 seconds = 13 h 43 min 3 s |
Is 49383 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 (49383 ÷ 3 = 16461) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (49383 ÷ 9 = 5487) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49383 a prime number?
No. 49383 = × 31 × 59, so it is divisible by 3.
What are the factors of 49383?
1, 3, 9, 27, 31, 59, 93, 177, 279, 531, 837, 1593, 1829, 5487, 16461, 49383.
What is 49383 in binary?
1100000011100111 (hexadecimal C0E7, octal 140347).
What is the square root of 49383?
About 222.2229, exactly 3√5487.
Is 49383 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49383?
49383 is a Harshad number: divisible by its digit sum 27.