The number 59041
59041 is a composite number with 8 divisors. Its prime factorisation is 17 × 23 × 151. Divisors (8): 1, 17, 23, 151, 391, 2567, 3473, 59041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59041 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59041 is composite. Its prime factorisation is
- 3
The divisors add up to 65664; without 59041 itself that is 6623, so 59041 is deficient (6623 is less than 59041). Euler's totient φ(59041) = 52800 numbers up to 59041 share no factor with it.
- 4
The digits of 59041 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59041 = 17 \times 23 \times 151 \]
59041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65664 |
| Euler totient φ(n) | 52800 |
| Square | 3485839681 |
| Cube | 205807460605921 |
| Square root | 242.983539 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9041 × |
59041 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and forty-one |
| Binary (base 2) | 1110011010100001 |
| Octal (base 8) | 163241 |
| Hexadecimal (base 16) | E6A1 |
| Base 3 | 2222222201 |
| As time | 59041 seconds = 16 h 24 min 1 s |
Is 59041 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 3) | 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 1) | 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 4) | 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 59041 a prime number?
No. 59041 = 17 × 23 × 151, so it is divisible by 17.
What are the factors of 59041?
1, 17, 23, 151, 391, 2567, 3473, 59041.
What is 59041 in binary?
1110011010100001 (hexadecimal E6A1, octal 163241).
What is the square root of 59041?
About 242.9835.
Is 59041 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 59041?
It is a composite number with 8 divisors.