The number 47957
47957 is a composite number with 16 divisors. Its prime factorisation is 7 × 13 × 17 × 31. Divisors (16): 1, 7, 13, 17, 31, 91, 119, 217, 221, 403, 527, 1547, 2821, 3689, 6851, 47957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47957 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47957 is composite. Its prime factorisation is
- 3
The divisors add up to 64512; without 47957 itself that is 16555, so 47957 is deficient (16555 is less than 47957). Euler's totient φ(47957) = 34560 numbers up to 47957 share no factor with it.
- 4
The digits of 47957 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47957 = 7 \times 13 \times 17 \times 31 \]
47957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 64512 |
| Euler totient φ(n) | 34560 |
| Square | 2299873849 |
| Cube | 110295050176493 |
| Square root | 218.990867 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7957 × |
47957 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-seven |
| Binary (base 2) | 1011101101010101 |
| Octal (base 8) | 135525 |
| Hexadecimal (base 16) | BB55 |
| Base 3 | 2102210012 |
| As time | 47957 seconds = 13 h 19 min 17 s |
Is 47957 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 1) | 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 | Yes (47957 ÷ 7 = 6851) | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47957 a prime number?
No. 47957 = 7 × 13 × 17 × 31, so it is divisible by 7.
What are the factors of 47957?
1, 7, 13, 17, 31, 91, 119, 217, 221, 403, 527, 1547, 2821, 3689, 6851, 47957.
What is 47957 in binary?
1011101101010101 (hexadecimal BB55, octal 135525).
What is the square root of 47957?
About 218.9909.
Is 47957 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 47957?
It is a composite number with 16 divisors.