The number 48577
48577 is a composite number with 4 divisors. Its prime factorisation is 31 × 1567. Divisors (4): 1, 31, 1567, 48577.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48577: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 31; a semiprime: 31 × 1567, the product of two primes.
- 2
48577 is composite. Its prime factorisation is
- 3
The divisors add up to 50176; without 48577 itself that is 1599, so 48577 is deficient (1599 is less than 48577). Euler's totient φ(48577) = 46980 numbers up to 48577 share no factor with it.
- 4
The digits of 48577 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48577 = 31 \times 1567 \]
48577 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50176 |
| Euler totient φ(n) | 46980 |
| Square | 2359724929 |
| Cube | 114628357876033 |
| Square root | 220.401906 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.8577 × |
48577 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and seventy-seven |
| Binary (base 2) | 1011110111000001 |
| Octal (base 8) | 136701 |
| Hexadecimal (base 16) | BDC1 |
| Base 3 | 2110122011 |
| As time | 48577 seconds = 13 h 29 min 37 s |
Is 48577 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48577 a prime number?
No. 48577 = 31 × 1567, so it is divisible by 31.
What are the factors of 48577?
1, 31, 1567, 48577.
What is 48577 in binary?
1011110111000001 (hexadecimal BDC1, octal 136701).
What is the square root of 48577?
About 220.4019.
Is 48577 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 48577?
48577 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 31; a semiprime: 31 × 1567, the product of two primes.