The number 59905
59905 is a composite number with 4 divisors. Its prime factorisation is 5 × 11981. Divisors (4): 1, 5, 11981, 59905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59905: a semiprime: 5 × 11981, the product of two primes.
- 2
59905 is composite. Its prime factorisation is
- 3
The divisors add up to 71892; without 59905 itself that is 11987, so 59905 is deficient (11987 is less than 59905). Euler's totient φ(59905) = 47920 numbers up to 59905 share no factor with it.
- 4
The digits of 59905 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59905 = 5 \times 11981 \]
59905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71892 |
| Euler totient φ(n) | 47920 |
| Square | 3588609025 |
| Cube | 214975623642625 |
| Square root | 244.754980 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9905 × |
59905 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and five |
| Binary (base 2) | 1110101000000001 |
| Octal (base 8) | 165001 |
| Hexadecimal (base 16) | EA01 |
| Base 3 | 10001011201 |
| As time | 59905 seconds = 16 h 38 min 25 s |
Is 59905 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 | Yes (59905 ÷ 5 = 11981) | 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 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 59905 a prime number?
No. 59905 = 5 × 11981, so it is divisible by 5.
What are the factors of 59905?
1, 5, 11981, 59905.
What is 59905 in binary?
1110101000000001 (hexadecimal EA01, octal 165001).
What is the square root of 59905?
About 244.7550.
Is 59905 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 59905?
59905 is a semiprime: 5 × 11981, the product of two primes.