The number 48364
48364 is a composite number with 12 divisors. Its prime factorisation is × 107 × 113. Divisors (12): 1, 2, 4, 107, 113, 214, 226, 428, 452, 12091, 24182, 48364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48364 is composite. Its prime factorisation is
- 3
The divisors add up to 86184; without 48364 itself that is 37820, so 48364 is deficient (37820 is less than 48364). Euler's totient φ(48364) = 23744 numbers up to 48364 share no factor with it.
- 4
The digits of 48364 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48364 = 2^{2} \times 107 \times 113 \]48364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86184 |
| Euler totient φ(n) | 23744 |
| Square | 2339076496 |
| Cube | 113127095652544 |
| Square root | 219.918167 (= 2√12091) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8364 × |
48364 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and sixty-four |
| Binary (base 2) | 1011110011101100 |
| Octal (base 8) | 136354 |
| Hexadecimal (base 16) | BCEC |
| Base 3 | 2110100021 |
| As time | 48364 seconds = 13 h 26 min 4 s |
Is 48364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48364 ÷ 2 = 24182) | 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 | Yes (48364 ÷ 4 = 12091) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48364 a prime number?
No. 48364 = × 107 × 113, so it is divisible by 2.
What are the factors of 48364?
1, 2, 4, 107, 113, 214, 226, 428, 452, 12091, 24182, 48364.
What is 48364 in binary?
1011110011101100 (hexadecimal BCEC, octal 136354).
What is the square root of 48364?
About 219.9182, exactly 2√12091.
Is 48364 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 48364?
It is a composite number with 12 divisors.