The number 47958
47958 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 7993. Divisors (8): 1, 2, 3, 6, 7993, 15986, 23979, 47958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47958 is composite. Its prime factorisation is
- 3
The divisors add up to 95928; without 47958 itself that is 47970, so 47958 is abundant (47970 is more than 47958). Euler's totient φ(47958) = 15984 numbers up to 47958 share no factor with it.
- 4
The digits of 47958 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 220 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47958 = 2 \times 3 \times 7993 \]
47958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 95928 |
| Euler totient φ(n) | 15984 |
| Square | 2299969764 |
| Cube | 110301949941912 |
| Square root | 218.993151 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 220 |
| Scientific notation | 4.7958 × |
47958 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-eight |
| Binary (base 2) | 1011101101010110 |
| Octal (base 8) | 135526 |
| Hexadecimal (base 16) | BB56 |
| Base 3 | 2102210020 |
| As time | 47958 seconds = 13 h 19 min 18 s |
Is 47958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47958 ÷ 2 = 23979) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (47958 ÷ 3 = 15986) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (47958 ÷ 6 = 7993) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 47958 a prime number?
No. 47958 = 2 × 3 × 7993, so it is divisible by 2.
What are the factors of 47958?
1, 2, 3, 6, 7993, 15986, 23979, 47958.
What is 47958 in binary?
1011101101010110 (hexadecimal BB56, octal 135526).
What is the square root of 47958?
About 218.9932.
Is 47958 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 47958?
It is a composite number with 8 divisors.