The number 47391
47391 is a composite number with 4 divisors. Its prime factorisation is 3 × 15797. Divisors (4): 1, 3, 15797, 47391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47391: a semiprime: 3 × 15797, the product of two primes.
- 2
47391 is composite. Its prime factorisation is
- 3
The divisors add up to 63192; without 47391 itself that is 15801, so 47391 is deficient (15801 is less than 47391). Euler's totient φ(47391) = 31592 numbers up to 47391 share no factor with it.
- 4
The digits of 47391 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47391 = 3 \times 15797 \]
47391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63192 |
| Euler totient φ(n) | 31592 |
| Square | 2245906881 |
| Cube | 106435772997471 |
| Square root | 217.694740 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.7391 × |
47391 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand three hundred and ninety-one |
| Binary (base 2) | 1011100100011111 |
| Octal (base 8) | 134437 |
| Hexadecimal (base 16) | B91F |
| Base 3 | 2102000020 |
| As time | 47391 seconds = 13 h 9 min 51 s |
Is 47391 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 (47391 ÷ 3 = 15797) | 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 | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | 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 47391 a prime number?
No. 47391 = 3 × 15797, so it is divisible by 3.
What are the factors of 47391?
1, 3, 15797, 47391.
What is 47391 in binary?
1011100100011111 (hexadecimal B91F, octal 134437).
What is the square root of 47391?
About 217.6947.
Is 47391 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 47391?
47391 is a semiprime: 3 × 15797, the product of two primes.