The number 48952
48952 is a composite number with 16 divisors. Its prime factorisation is × 29 × 211. Divisors (16): 1, 2, 4, 8, 29, 58, 116, 211, 232, 422, 844, 1688, 6119, 12238, 24476, 48952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48952: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48952 is composite. Its prime factorisation is
- 3
The divisors add up to 95400; without 48952 itself that is 46448, so 48952 is deficient (46448 is less than 48952). Euler's totient φ(48952) = 23520 numbers up to 48952 share no factor with it.
- 4
The digits of 48952 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48952 = 2^{3} \times 29 \times 211 \]48952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 95400 |
| Euler totient φ(n) | 23520 |
| Square | 2396298304 |
| Cube | 117303594577408 |
| Square root | 221.250989 (= 2√12238) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8952 × |
48952 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-two |
| Binary (base 2) | 1011111100111000 |
| Octal (base 8) | 137470 |
| Hexadecimal (base 16) | BF38 |
| Base 3 | 2111011001 |
| As time | 48952 seconds = 13 h 35 min 52 s |
Is 48952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48952 ÷ 2 = 24476) | 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 (48952 ÷ 4 = 12238) | 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 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 | Yes (48952 ÷ 8 = 6119) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48952 a prime number?
No. 48952 = × 29 × 211, so it is divisible by 2.
What are the factors of 48952?
1, 2, 4, 8, 29, 58, 116, 211, 232, 422, 844, 1688, 6119, 12238, 24476, 48952.
What is 48952 in binary?
1011111100111000 (hexadecimal BF38, octal 137470).
What is the square root of 48952?
About 221.2510, exactly 2√12238.
Is 48952 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 48952?
48952 is a happy number: repeatedly adding the squares of its digits reaches 1.