The number 59491
59491 is a composite number with 4 divisors. Its prime factorisation is 41 × 1451. Divisors (4): 1, 41, 1451, 59491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59491: a semiprime: 41 × 1451, the product of two primes.
- 2
59491 is composite. Its prime factorisation is
- 3
The divisors add up to 60984; without 59491 itself that is 1493, so 59491 is deficient (1493 is less than 59491). Euler's totient φ(59491) = 58000 numbers up to 59491 share no factor with it.
- 4
The digits of 59491 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59491 = 41 \times 1451 \]
59491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60984 |
| Euler totient φ(n) | 58000 |
| Square | 3539179081 |
| Cube | 210549302707771 |
| Square root | 243.907769 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9491 × |
59491 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and ninety-one |
| Binary (base 2) | 1110100001100011 |
| Octal (base 8) | 164143 |
| Hexadecimal (base 16) | E863 |
| Base 3 | 10000121101 |
| As time | 59491 seconds = 16 h 31 min 31 s |
Is 59491 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 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 5) | 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 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 3) | 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 59491 a prime number?
No. 59491 = 41 × 1451, so it is divisible by 41.
What are the factors of 59491?
1, 41, 1451, 59491.
What is 59491 in binary?
1110100001100011 (hexadecimal E863, octal 164143).
What is the square root of 59491?
About 243.9078.
Is 59491 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 59491?
59491 is a semiprime: 41 × 1451, the product of two primes.