The number 47461
47461 is a composite number with 4 divisors. Its prime factorisation is 31 × 1531. Divisors (4): 1, 31, 1531, 47461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47461: a semiprime: 31 × 1531, the product of two primes.
- 2
47461 is composite. Its prime factorisation is
- 3
The divisors add up to 49024; without 47461 itself that is 1563, so 47461 is deficient (1563 is less than 47461). Euler's totient φ(47461) = 45900 numbers up to 47461 share no factor with it.
- 4
The digits of 47461 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47461 = 31 \times 1531 \]
47461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49024 |
| Euler totient φ(n) | 45900 |
| Square | 2252546521 |
| Cube | 106908110433181 |
| Square root | 217.855457 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.7461 × |
47461 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand four hundred and sixty-one |
| Binary (base 2) | 1011100101100101 |
| Octal (base 8) | 134545 |
| Hexadecimal (base 16) | B965 |
| Base 3 | 2102002211 |
| As time | 47461 seconds = 13 h 11 min 1 s |
Is 47461 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 4) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47461 a prime number?
No. 47461 = 31 × 1531, so it is divisible by 31.
What are the factors of 47461?
1, 31, 1531, 47461.
What is 47461 in binary?
1011100101100101 (hexadecimal B965, octal 134545).
What is the square root of 47461?
About 217.8555.
Is 47461 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 47461?
47461 is a semiprime: 31 × 1531, the product of two primes.