The number 47961
47961 is a perfect square (219²). Its prime factorisation is × . Divisors (9): 1, 3, 9, 73, 219, 657, 5329, 15987, 47961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47961: a perfect square (219²).
- 2
47961 is composite. Its prime factorisation is
- 3
The divisors add up to 70239; without 47961 itself that is 22278, so 47961 is deficient (22278 is less than 47961). Euler's totient φ(47961) = 31536 numbers up to 47961 share no factor with it.
- 4
The digits of 47961 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47961 = 3^{2} \times 73^{2} \]47961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 9 |
| Sum of divisors | 70239 |
| Euler totient φ(n) | 31536 |
| Square | 2300257521 |
| Cube | 110322650964681 |
| Square root | 219 |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.7961 × |
| Perfect power |
47961 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and sixty-one |
| Binary (base 2) | 1011101101011001 |
| Octal (base 8) | 135531 |
| Hexadecimal (base 16) | BB59 |
| Base 3 | 2102210100 |
| As time | 47961 seconds = 13 h 19 min 21 s |
Is 47961 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 (47961 ÷ 3 = 15987) | 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 1) | 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 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 | Yes (47961 ÷ 9 = 5329) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 47961 a prime number?
No. 47961 = × , so it is divisible by 3.
What are the factors of 47961?
1, 3, 9, 73, 219, 657, 5329, 15987, 47961.
What is 47961 in binary?
1011101101011001 (hexadecimal BB59, octal 135531).
What is the square root of 47961?
219, because 219 × 219 = 47961.
Is 47961 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 47961?
47961 is a perfect square (219²).