The number 59955
59955 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 571. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 571, 1713, 2855, 3997, 8565, 11991, 19985, 59955.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59955 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59955 is composite. Its prime factorisation is
- 3
The divisors add up to 109824; without 59955 itself that is 49869, so 59955 is deficient (49869 is less than 59955). Euler's totient φ(59955) = 27360 numbers up to 59955 share no factor with it.
- 4
The digits of 59955 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59955 = 3 \times 5 \times 7 \times 571 \]
59955 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 109824 |
| Euler totient φ(n) | 27360 |
| Square | 3594602025 |
| Cube | 215514364408875 |
| Square root | 244.857101 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.9955 × |
59955 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and fifty-five |
| Binary (base 2) | 1110101000110011 |
| Octal (base 8) | 165063 |
| Hexadecimal (base 16) | EA33 |
| Base 3 | 10001020120 |
| As time | 59955 seconds = 16 h 39 min 15 s |
Is 59955 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 (59955 ÷ 3 = 19985) | 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 | Yes (59955 ÷ 5 = 11991) | 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 | Yes (59955 ÷ 7 = 8565) | 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 6) | 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 5) | 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 59955 a prime number?
No. 59955 = 3 × 5 × 7 × 571, so it is divisible by 3.
What are the factors of 59955?
1, 3, 5, 7, 15, 21, 35, 105, 571, 1713, 2855, 3997, 8565, 11991, 19985, 59955.
What is 59955 in binary?
1110101000110011 (hexadecimal EA33, octal 165063).
What is the square root of 59955?
About 244.8571.
Is 59955 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 59955?
It is a composite number with 16 divisors.