The number 47295
47295 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1051. Divisors (12): 1, 3, 5, 9, 15, 45, 1051, 3153, 5255, 9459, 15765, 47295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47295 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47295 is composite. Its prime factorisation is
- 3
The divisors add up to 82056; without 47295 itself that is 34761, so 47295 is deficient (34761 is less than 47295). Euler's totient φ(47295) = 25200 numbers up to 47295 share no factor with it.
- 4
The digits of 47295 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 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47295 = 3^{2} \times 5 \times 1051 \]47295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82056 |
| Euler totient φ(n) | 25200 |
| Square | 2236817025 |
| Cube | 105790261197375 |
| Square root | 217.474136 (= 3√5255) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.7295 × |
47295 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand two hundred and ninety-five |
| Binary (base 2) | 1011100010111111 |
| Octal (base 8) | 134277 |
| Hexadecimal (base 16) | B8BF |
| Base 3 | 2101212200 |
| As time | 47295 seconds = 13 h 8 min 15 s |
Is 47295 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 (47295 ÷ 3 = 15765) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (47295 ÷ 5 = 9459) | 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 | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (47295 ÷ 9 = 5255) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47295 a prime number?
No. 47295 = × 5 × 1051, so it is divisible by 3.
What are the factors of 47295?
1, 3, 5, 9, 15, 45, 1051, 3153, 5255, 9459, 15765, 47295.
What is 47295 in binary?
1011100010111111 (hexadecimal B8BF, octal 134277).
What is the square root of 47295?
About 217.4741, exactly 3√5255.
Is 47295 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 47295?
It is a composite number with 12 divisors.