The number 48152
48152 is a composite number with 16 divisors. Its prime factorisation is × 13 × 463. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 463, 926, 1852, 3704, 6019, 12038, 24076, 48152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48152 is composite. Its prime factorisation is
- 3
The divisors add up to 97440; without 48152 itself that is 49288, so 48152 is abundant (49288 is more than 48152). Euler's totient φ(48152) = 22176 numbers up to 48152 share no factor with it.
- 4
The digits of 48152 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 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48152 = 2^{3} \times 13 \times 463 \]48152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 97440 |
| Euler totient φ(n) | 22176 |
| Square | 2318615104 |
| Cube | 111645954487808 |
| Square root | 219.435640 (= 2√12038) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.8152 × |
48152 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand one hundred and fifty-two |
| Binary (base 2) | 1011110000011000 |
| Octal (base 8) | 136030 |
| Hexadecimal (base 16) | BC18 |
| Base 3 | 2110001102 |
| As time | 48152 seconds = 13 h 22 min 32 s |
Is 48152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48152 ÷ 2 = 24076) | 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 (48152 ÷ 4 = 12038) | 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 6) | 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 (48152 ÷ 8 = 6019) | 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 5) | 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 48152 a prime number?
No. 48152 = × 13 × 463, so it is divisible by 2.
What are the factors of 48152?
1, 2, 4, 8, 13, 26, 52, 104, 463, 926, 1852, 3704, 6019, 12038, 24076, 48152.
What is 48152 in binary?
1011110000011000 (hexadecimal BC18, octal 136030).
What is the square root of 48152?
About 219.4356, exactly 2√12038.
Is 48152 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48152?
It is a composite number with 16 divisors.