The number 48064
48064 is a composite number with 14 divisors. Its prime factorisation is × 751. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 751, 1502, 3004, 6008, 12016, 24032, 48064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48064 is composite. Its prime factorisation is
- 3
The divisors add up to 95504; without 48064 itself that is 47440, so 48064 is deficient (47440 is less than 48064). Euler's totient φ(48064) = 24000 numbers up to 48064 share no factor with it.
- 4
The digits of 48064 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48064 = 2^{6} \times 751 \]48064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 95504 |
| Euler totient φ(n) | 24000 |
| Square | 2310148096 |
| Cube | 111034958086144 |
| Square root | 219.235034 (= 8√751) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8064 × |
48064 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and sixty-four |
| Binary (base 2) | 1011101111000000 |
| Octal (base 8) | 135700 |
| Hexadecimal (base 16) | BBC0 |
| Base 3 | 2102221011 |
| As time | 48064 seconds = 13 h 21 min 4 s |
Is 48064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48064 ÷ 2 = 24032) | 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 (48064 ÷ 4 = 12016) | 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 2) | 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 | Yes (48064 ÷ 8 = 6008) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 5) | 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 48064 a prime number?
No. 48064 = × 751, so it is divisible by 2.
What are the factors of 48064?
1, 2, 4, 8, 16, 32, 64, 751, 1502, 3004, 6008, 12016, 24032, 48064.
What is 48064 in binary?
1011101111000000 (hexadecimal BBC0, octal 135700).
What is the square root of 48064?
About 219.2350, exactly 8√751.
Is 48064 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 48064?
It is a composite number with 14 divisors.