The number 59991
59991 is a binary palindrome (1110101001010111). Its prime factorisation is 3 × 19997. Divisors (4): 1, 3, 19997, 59991.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59991: a binary palindrome (1110101001010111); a semiprime: 3 × 19997, the product of two primes.
- 2
59991 is composite. Its prime factorisation is
- 3
The divisors add up to 79992; without 59991 itself that is 20001, so 59991 is deficient (20001 is less than 59991). Euler's totient φ(59991) = 39992 numbers up to 59991 share no factor with it.
- 4
The digits of 59991 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59991 = 3 \times 19997 \]
59991 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 79992 |
| Euler totient φ(n) | 39992 |
| Square | 3598920081 |
| Cube | 215902814579271 |
| Square root | 244.930602 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.9991 × |
59991 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and ninety-one |
| Binary (base 2) | 1110101001010111 |
| Octal (base 8) | 165127 |
| Hexadecimal (base 16) | EA57 |
| Base 3 | 10001021220 |
| As time | 59991 seconds = 16 h 39 min 51 s |
Is 59991 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 | Yes (59991 ÷ 3 = 19997) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59991 a prime number?
No. 59991 = 3 × 19997, so it is divisible by 3.
What are the factors of 59991?
1, 3, 19997, 59991.
What is 59991 in binary?
1110101001010111 (hexadecimal EA57, octal 165127).
What is the square root of 59991?
About 244.9306.
Is 59991 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 59991?
59991 is a binary palindrome (1110101001010111); a semiprime: 3 × 19997, the product of two primes.