The number 59641
59641 is a composite number with 8 divisors. Its prime factorisation is 19 × 43 × 73. Divisors (8): 1, 19, 43, 73, 817, 1387, 3139, 59641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59641 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59641 is composite. Its prime factorisation is
- 3
The divisors add up to 65120; without 59641 itself that is 5479, so 59641 is deficient (5479 is less than 59641). Euler's totient φ(59641) = 54432 numbers up to 59641 share no factor with it.
- 4
The digits of 59641 add up to 25, 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
\[ 59641 = 19 \times 43 \times 73 \]
59641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65120 |
| Euler totient φ(n) | 54432 |
| Square | 3557048881 |
| Cube | 212145952311721 |
| Square root | 244.215069 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9641 × |
59641 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand six hundred and forty-one |
| Binary (base 2) | 1110100011111001 |
| Octal (base 8) | 164371 |
| Hexadecimal (base 16) | E8F9 |
| Base 3 | 10000210221 |
| As time | 59641 seconds = 16 h 34 min 1 s |
Is 59641 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 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 1) | 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 1) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59641 a prime number?
No. 59641 = 19 × 43 × 73, so it is divisible by 19.
What are the factors of 59641?
1, 19, 43, 73, 817, 1387, 3139, 59641.
What is 59641 in binary?
1110100011111001 (hexadecimal E8F9, octal 164371).
What is the square root of 59641?
About 244.2151.
Is 59641 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59641?
It is a composite number with 8 divisors.