The number 947
947 is the 161st prime number. Its only divisors are 1 and 947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 947: the 161st prime number.
- 2
947 is prime, so its only factors are 1 and 947. It is the 161st prime; the next prime is 953 and the one before is 941.
- 3
The divisors add up to 948; without 947 itself that is 1, so 947 is deficient (1 is less than 947). Euler's totient φ(947) = 946 numbers up to 947 share no factor with it.
- 4
The digits of 947 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
947 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 948 |
| Euler totient φ(n) | 946 |
| Square | 896809 |
| Cube | 849278123 |
| Square root | 30.773365 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 36 |
| Scientific notation | 9.47 × |
947 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and forty-seven |
| Roman numerals | CMXLVII |
| Binary (base 2) | 1110110011 |
| Octal (base 8) | 1663 |
| Hexadecimal (base 16) | 3B3 |
| Base 3 | 1022002 |
| As time | 947 seconds = 15 min 47 s |
Is 947 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 947 a prime number?
Yes. 947 is divisible only by 1 and itself.
What are the factors of 947?
1, 947.
What is 947 in binary?
1110110011 (hexadecimal 3B3, octal 1663).
What is the square root of 947?
About 30.7734.
What is 947 in Roman numerals?
CMXLVII.
Is 947 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 947?
947 is the 161st prime number.