The number 59947
59947 is a composite number with 4 divisors. Its prime factorisation is 151 × 397. Divisors (4): 1, 151, 397, 59947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59947: a semiprime: 151 × 397, the product of two primes.
- 2
59947 is composite. Its prime factorisation is
- 3
The divisors add up to 60496; without 59947 itself that is 549, so 59947 is deficient (549 is less than 59947). Euler's totient φ(59947) = 59400 numbers up to 59947 share no factor with it.
- 4
The digits of 59947 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59947 = 151 \times 397 \]
59947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60496 |
| Euler totient φ(n) | 59400 |
| Square | 3593642809 |
| Cube | 215428105471123 |
| Square root | 244.840765 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9947 × |
59947 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and forty-seven |
| Binary (base 2) | 1110101000101011 |
| Octal (base 8) | 165053 |
| Hexadecimal (base 16) | EA2B |
| Base 3 | 10001020021 |
| As time | 59947 seconds = 16 h 39 min 7 s |
Is 59947 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 6) | 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 8) | 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 59947 a prime number?
No. 59947 = 151 × 397, so it is divisible by 151.
What are the factors of 59947?
1, 151, 397, 59947.
What is 59947 in binary?
1110101000101011 (hexadecimal EA2B, octal 165053).
What is the square root of 59947?
About 244.8408.
Is 59947 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 59947?
59947 is a semiprime: 151 × 397, the product of two primes.