The number 47959
47959 is a composite number with 4 divisors. Its prime factorisation is 199 × 241. Divisors (4): 1, 199, 241, 47959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47959: a semiprime: 199 × 241, the product of two primes.
- 2
47959 is composite. Its prime factorisation is
- 3
The divisors add up to 48400; without 47959 itself that is 441, so 47959 is deficient (441 is less than 47959). Euler's totient φ(47959) = 47520 numbers up to 47959 share no factor with it.
- 4
The digits of 47959 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 220 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47959 = 199 \times 241 \]
47959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48400 |
| Euler totient φ(n) | 47520 |
| Square | 2300065681 |
| Cube | 110308849995079 |
| Square root | 218.995434 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 220 |
| Scientific notation | 4.7959 × |
47959 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-nine |
| Binary (base 2) | 1011101101010111 |
| Octal (base 8) | 135527 |
| Hexadecimal (base 16) | BB57 |
| Base 3 | 2102210021 |
| As time | 47959 seconds = 13 h 19 min 19 s |
Is 47959 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 4) | 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 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 47959 a prime number?
No. 47959 = 199 × 241, so it is divisible by 199.
What are the factors of 47959?
1, 199, 241, 47959.
What is 47959 in binary?
1011101101010111 (hexadecimal BB57, octal 135527).
What is the square root of 47959?
About 218.9954.
Is 47959 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 47959?
47959 is a semiprime: 199 × 241, the product of two primes.