The number 48592
48592 is a composite number with 10 divisors. Its prime factorisation is × 3037. Divisors (10): 1, 2, 4, 8, 16, 3037, 6074, 12148, 24296, 48592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48592: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48592 is composite. Its prime factorisation is
- 3
The divisors add up to 94178; without 48592 itself that is 45586, so 48592 is deficient (45586 is less than 48592). Euler's totient φ(48592) = 24288 numbers up to 48592 share no factor with it.
- 4
The digits of 48592 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
\[ 48592 = 2^{4} \times 3037 \]48592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 94178 |
| Euler totient φ(n) | 24288 |
| Square | 2361182464 |
| Cube | 114734578290688 |
| Square root | 220.435932 (= 4√3037) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8592 × |
48592 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and ninety-two |
| Binary (base 2) | 1011110111010000 |
| Octal (base 8) | 136720 |
| Hexadecimal (base 16) | BDD0 |
| Base 3 | 2110122201 |
| As time | 48592 seconds = 13 h 29 min 52 s |
Is 48592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48592 ÷ 2 = 24296) | 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 (48592 ÷ 4 = 12148) | 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 5) | 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 (48592 ÷ 8 = 6074) | 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 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 48592 a prime number?
No. 48592 = × 3037, so it is divisible by 2.
What are the factors of 48592?
1, 2, 4, 8, 16, 3037, 6074, 12148, 24296, 48592.
What is 48592 in binary?
1011110111010000 (hexadecimal BDD0, octal 136720).
What is the square root of 48592?
About 220.4359, exactly 4√3037.
Is 48592 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 48592?
48592 is a happy number: repeatedly adding the squares of its digits reaches 1.