The number 59681
59681 is a composite number with 4 divisors. Its prime factorisation is 37 × 1613. Divisors (4): 1, 37, 1613, 59681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59681: a semiprime: 37 × 1613, the product of two primes.
- 2
59681 is composite. Its prime factorisation is
- 3
The divisors add up to 61332; without 59681 itself that is 1651, so 59681 is deficient (1651 is less than 59681). Euler's totient φ(59681) = 58032 numbers up to 59681 share no factor with it.
- 4
The digits of 59681 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59681 = 37 \times 1613 \]
59681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61332 |
| Euler totient φ(n) | 58032 |
| Square | 3561821761 |
| Cube | 212573084518241 |
| Square root | 244.296950 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.9681 × |
59681 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand six hundred and eighty-one |
| Binary (base 2) | 1110100100100001 |
| Octal (base 8) | 164441 |
| Hexadecimal (base 16) | E921 |
| Base 3 | 10000212102 |
| As time | 59681 seconds = 16 h 34 min 41 s |
Is 59681 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 1) | 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 | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59681 a prime number?
No. 59681 = 37 × 1613, so it is divisible by 37.
What are the factors of 59681?
1, 37, 1613, 59681.
What is 59681 in binary?
1110100100100001 (hexadecimal E921, octal 164441).
What is the square root of 59681?
About 244.2970.
Is 59681 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 59681?
59681 is a semiprime: 37 × 1613, the product of two primes.