The number 47361
47361 is a composite number with 4 divisors. Its prime factorisation is 3 × 15787. Divisors (4): 1, 3, 15787, 47361.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47361: a semiprime: 3 × 15787, the product of two primes.
- 2
47361 is composite. Its prime factorisation is
- 3
The divisors add up to 63152; without 47361 itself that is 15791, so 47361 is deficient (15791 is less than 47361). Euler's totient φ(47361) = 31572 numbers up to 47361 share no factor with it.
- 4
The digits of 47361 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47361 = 3 \times 15787 \]
47361 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63152 |
| Euler totient φ(n) | 31572 |
| Square | 2243064321 |
| Cube | 106233769306881 |
| Square root | 217.625826 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.7361 × |
47361 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand three hundred and sixty-one |
| Binary (base 2) | 1011100100000001 |
| Octal (base 8) | 134401 |
| Hexadecimal (base 16) | B901 |
| Base 3 | 2101222010 |
| As time | 47361 seconds = 13 h 9 min 21 s |
Is 47361 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 (47361 ÷ 3 = 15787) | 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 6) | 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 3) | 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 6) | 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 47361 a prime number?
No. 47361 = 3 × 15787, so it is divisible by 3.
What are the factors of 47361?
1, 3, 15787, 47361.
What is 47361 in binary?
1011100100000001 (hexadecimal B901, octal 134401).
What is the square root of 47361?
About 217.6258.
Is 47361 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 47361?
47361 is a semiprime: 3 × 15787, the product of two primes.