The number 48512
48512 is a composite number with 16 divisors. Its prime factorisation is × 379. Divisors (16): 1, 2, 4, 8, 16, 32, 64, 128, 379, 758, 1516, 3032, 6064, 12128, 24256, 48512.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48512 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48512 is composite. Its prime factorisation is
- 3
The divisors add up to 96900; without 48512 itself that is 48388, so 48512 is deficient (48388 is less than 48512). Euler's totient φ(48512) = 24192 numbers up to 48512 share no factor with it.
- 4
The digits of 48512 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48512 = 2^{7} \times 379 \]48512 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 96900 |
| Euler totient φ(n) | 24192 |
| Square | 2353414144 |
| Cube | 114168826953728 |
| Square root | 220.254398 (= 8√758) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8512 × |
48512 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and twelve |
| Binary (base 2) | 1011110110000000 |
| Octal (base 8) | 136600 |
| Hexadecimal (base 16) | BD80 |
| Base 3 | 2110112202 |
| As time | 48512 seconds = 13 h 28 min 32 s |
Is 48512 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48512 ÷ 2 = 24256) | 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 | Yes (48512 ÷ 4 = 12128) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 (48512 ÷ 8 = 6064) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48512 a prime number?
No. 48512 = × 379, so it is divisible by 2.
What are the factors of 48512?
1, 2, 4, 8, 16, 32, 64, 128, 379, 758, 1516, 3032, 6064, 12128, 24256, 48512.
What is 48512 in binary?
1011110110000000 (hexadecimal BD80, octal 136600).
What is the square root of 48512?
About 220.2544, exactly 8√758.
Is 48512 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48512?
It is a composite number with 16 divisors.