The number 48632
48632 is a composite number with 8 divisors. Its prime factorisation is × 6079. Divisors (8): 1, 2, 4, 8, 6079, 12158, 24316, 48632.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48632: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48632 is composite. Its prime factorisation is
- 3
The divisors add up to 91200; without 48632 itself that is 42568, so 48632 is deficient (42568 is less than 48632). Euler's totient φ(48632) = 24312 numbers up to 48632 share no factor with it.
- 4
The digits of 48632 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48632 = 2^{3} \times 6079 \]48632 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91200 |
| Euler totient φ(n) | 24312 |
| Square | 2365071424 |
| Cube | 115018153491968 |
| Square root | 220.526642 (= 2√12158) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8632 × |
48632 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and thirty-two |
| Binary (base 2) | 1011110111111000 |
| Octal (base 8) | 136770 |
| Hexadecimal (base 16) | BDF8 |
| Base 3 | 2110201012 |
| As time | 48632 seconds = 13 h 30 min 32 s |
Is 48632 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48632 ÷ 2 = 24316) | 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 (48632 ÷ 4 = 12158) | 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 3) | 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 (48632 ÷ 8 = 6079) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | 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 48632 a prime number?
No. 48632 = × 6079, so it is divisible by 2.
What are the factors of 48632?
1, 2, 4, 8, 6079, 12158, 24316, 48632.
What is 48632 in binary?
1011110111111000 (hexadecimal BDF8, octal 136770).
What is the square root of 48632?
About 220.5266, exactly 2√12158.
Is 48632 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48632?
48632 is a happy number: repeatedly adding the squares of its digits reaches 1.