The number 59956
59956 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1153. Divisors (12): 1, 2, 4, 13, 26, 52, 1153, 2306, 4612, 14989, 29978, 59956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59956 is composite. Its prime factorisation is
- 3
The divisors add up to 113092; without 59956 itself that is 53136, so 59956 is deficient (53136 is less than 59956). Euler's totient φ(59956) = 27648 numbers up to 59956 share no factor with it.
- 4
The digits of 59956 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59956 = 2^{2} \times 13 \times 1153 \]59956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 113092 |
| Euler totient φ(n) | 27648 |
| Square | 3594721936 |
| Cube | 215525148394816 |
| Square root | 244.859143 (= 2√14989) |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.9956 × |
59956 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and fifty-six |
| Binary (base 2) | 1110101000110100 |
| Octal (base 8) | 165064 |
| Hexadecimal (base 16) | EA34 |
| Base 3 | 10001020121 |
| As time | 59956 seconds = 16 h 39 min 16 s |
Is 59956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59956 ÷ 2 = 29978) | 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 | Yes (59956 ÷ 4 = 14989) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59956 a prime number?
No. 59956 = × 13 × 1153, so it is divisible by 2.
What are the factors of 59956?
1, 2, 4, 13, 26, 52, 1153, 2306, 4612, 14989, 29978, 59956.
What is 59956 in binary?
1110101000110100 (hexadecimal EA34, octal 165064).
What is the square root of 59956?
About 244.8591, exactly 2√14989.
Is 59956 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 59956?
It is a composite number with 12 divisors.