The number 48573
48573 is a binary palindrome (1011110110111101). Its prime factorisation is × 7 × 257. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 257, 771, 1799, 2313, 5397, 6939, 16191, 48573.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48573: a binary palindrome (1011110110111101); a Harshad number: divisible by its digit sum 27.
- 2
48573 is composite. Its prime factorisation is
- 3
The divisors add up to 82560; without 48573 itself that is 33987, so 48573 is deficient (33987 is less than 48573). Euler's totient φ(48573) = 27648 numbers up to 48573 share no factor with it.
- 4
The digits of 48573 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48573 = 3^{3} \times 7 \times 257 \]48573 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 82560 |
| Euler totient φ(n) | 27648 |
| Square | 2359336329 |
| Cube | 114600043508517 |
| Square root | 220.392831 (= 3√5397) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.8573 × |
48573 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and seventy-three |
| Binary (base 2) | 1011110110111101 |
| Octal (base 8) | 136675 |
| Hexadecimal (base 16) | BDBD |
| Base 3 | 2110122000 |
| As time | 48573 seconds = 13 h 29 min 33 s |
Is 48573 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 | Yes (48573 ÷ 3 = 16191) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48573 ÷ 7 = 6939) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48573 ÷ 9 = 5397) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48573 a prime number?
No. 48573 = × 7 × 257, so it is divisible by 3.
What are the factors of 48573?
1, 3, 7, 9, 21, 27, 63, 189, 257, 771, 1799, 2313, 5397, 6939, 16191, 48573.
What is 48573 in binary?
1011110110111101 (hexadecimal BDBD, octal 136675).
What is the square root of 48573?
About 220.3928, exactly 3√5397.
Is 48573 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48573?
48573 is a binary palindrome (1011110110111101); a Harshad number: divisible by its digit sum 27.