The number 5947
5947 is a composite number with 4 divisors. Its prime factorisation is 19 × 313. Divisors (4): 1, 19, 313, 5947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5947: a semiprime: 19 × 313, the product of two primes.
- 2
5947 is composite. Its prime factorisation is
- 3
The divisors add up to 6280; without 5947 itself that is 333, so 5947 is deficient (333 is less than 5947). Euler's totient φ(5947) = 5616 numbers up to 5947 share no factor with it.
- 4
The digits of 5947 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5947 = 19 \times 313 \]
5947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6280 |
| Euler totient φ(n) | 5616 |
| Square | 35366809 |
| Cube | 210326413123 |
| Square root | 77.116795 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 142 |
| Scientific notation | 5.947 × |
5947 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and forty-seven |
| Binary (base 2) | 1011100111011 |
| Octal (base 8) | 13473 |
| Hexadecimal (base 16) | 173B |
| Base 3 | 22011021 |
| As time | 5947 seconds = 1 h 39 min 7 s |
Is 5947 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5947 a prime number?
No. 5947 = 19 × 313, so it is divisible by 19.
What are the factors of 5947?
1, 19, 313, 5947.
What is 5947 in binary?
1011100111011 (hexadecimal 173B, octal 13473).
What is the square root of 5947?
About 77.1168.
Is 5947 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 5947?
5947 is a semiprime: 19 × 313, the product of two primes.