The number 47561
47561 is a composite number with 4 divisors. Its prime factorisation is 199 × 239. Divisors (4): 1, 199, 239, 47561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47561: a semiprime: 199 × 239, the product of two primes.
- 2
47561 is composite. Its prime factorisation is
- 3
The divisors add up to 48000; without 47561 itself that is 439, so 47561 is deficient (439 is less than 47561). Euler's totient φ(47561) = 47124 numbers up to 47561 share no factor with it.
- 4
The digits of 47561 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47561 = 199 \times 239 \]
47561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48000 |
| Euler totient φ(n) | 47124 |
| Square | 2262048721 |
| Cube | 107585299219481 |
| Square root | 218.084846 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.7561 × |
47561 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand five hundred and sixty-one |
| Binary (base 2) | 1011100111001001 |
| Octal (base 8) | 134711 |
| Hexadecimal (base 16) | B9C9 |
| Base 3 | 2102020112 |
| As time | 47561 seconds = 13 h 12 min 41 s |
Is 47561 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 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47561 a prime number?
No. 47561 = 199 × 239, so it is divisible by 199.
What are the factors of 47561?
1, 199, 239, 47561.
What is 47561 in binary?
1011100111001001 (hexadecimal B9C9, octal 134711).
What is the square root of 47561?
About 218.0848.
Is 47561 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 47561?
47561 is a semiprime: 199 × 239, the product of two primes.