The number 59950
59950 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 109. Divisors (24): 1, 2, 5, 10, 11, 22, 25, 50, 55, 109, 110, 218, 275, 545, 550, 1090 … 59950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59950 is composite. Its prime factorisation is
- 3
The divisors add up to 122760; without 59950 itself that is 62810, so 59950 is abundant (62810 is more than 59950). Euler's totient φ(59950) = 21600 numbers up to 59950 share no factor with it.
- 4
The digits of 59950 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59950 = 2 \times 5^{2} \times 11 \times 109 \]59950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 122760 |
| Euler totient φ(n) | 21600 |
| Square | 3594002500 |
| Cube | 215460449875000 |
| Square root | 244.846891 (= 5√2398) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.995 × |
59950 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and fifty |
| Binary (base 2) | 1110101000101110 |
| Octal (base 8) | 165056 |
| Hexadecimal (base 16) | EA2E |
| Base 3 | 10001020101 |
| As time | 59950 seconds = 16 h 39 min 10 s |
Is 59950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59950 ÷ 2 = 29975) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59950 ÷ 5 = 11990) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 | Yes (59950 ÷ 10 = 5995) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (59950 ÷ 11 = 5450) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59950 a prime number?
No. 59950 = 2 × × 11 × 109, so it is divisible by 2.
What are the factors of 59950?
1, 2, 5, 10, 11, 22, 25, 50, 55, 109, 110, 218, 275, 545, 550, 1090, 1199, 2398, 2725, 5450, 5995, 11990, 29975, 59950.
What is 59950 in binary?
1110101000101110 (hexadecimal EA2E, octal 165056).
What is the square root of 59950?
About 244.8469, exactly 5√2398.
Is 59950 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 59950?
It is a composite number with 24 divisors.