The number 47565
47565 is a composite number with 24 divisors. Its prime factorisation is × 5 × 7 × 151. Divisors (24): 1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 151, 315, 453, 755, 1057 … 47565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47565 is composite. Its prime factorisation is
- 3
The divisors add up to 94848; without 47565 itself that is 47283, so 47565 is deficient (47283 is less than 47565). Euler's totient φ(47565) = 21600 numbers up to 47565 share no factor with it.
- 4
The digits of 47565 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47565 = 3^{2} \times 5 \times 7 \times 151 \]47565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 94848 |
| Euler totient φ(n) | 21600 |
| Square | 2262429225 |
| Cube | 107612446087125 |
| Square root | 218.094016 (= 3√5285) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7565 × |
47565 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand five hundred and sixty-five |
| Binary (base 2) | 1011100111001101 |
| Octal (base 8) | 134715 |
| Hexadecimal (base 16) | B9CD |
| Base 3 | 2102020200 |
| As time | 47565 seconds = 13 h 12 min 45 s |
Is 47565 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 (47565 ÷ 3 = 15855) | 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 | Yes (47565 ÷ 5 = 9513) | 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 (47565 ÷ 7 = 6795) | 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 (47565 ÷ 9 = 5285) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47565 a prime number?
No. 47565 = × 5 × 7 × 151, so it is divisible by 3.
What are the factors of 47565?
1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 151, 315, 453, 755, 1057, 1359, 2265, 3171, 5285, 6795, 9513, 15855, 47565.
What is 47565 in binary?
1011100111001101 (hexadecimal B9CD, octal 134715).
What is the square root of 47565?
About 218.0940, exactly 3√5285.
Is 47565 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 47565?
It is a composite number with 24 divisors.