The number 49959
49959 is a composite number with 24 divisors. Its prime factorisation is × 7 × 13 × 61. Divisors (24): 1, 3, 7, 9, 13, 21, 39, 61, 63, 91, 117, 183, 273, 427, 549, 793 … 49959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49959 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49959 is composite. Its prime factorisation is
- 3
The divisors add up to 90272; without 49959 itself that is 40313, so 49959 is deficient (40313 is less than 49959). Euler's totient φ(49959) = 25920 numbers up to 49959 share no factor with it.
- 4
The digits of 49959 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49959 = 3^{2} \times 7 \times 13 \times 61 \]49959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 90272 |
| Euler totient φ(n) | 25920 |
| Square | 2495901681 |
| Cube | 124692752081079 |
| Square root | 223.515100 (= 3√5551) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9959 × |
49959 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and fifty-nine |
| Binary (base 2) | 1100001100100111 |
| Octal (base 8) | 141447 |
| Hexadecimal (base 16) | C327 |
| Base 3 | 2112112100 |
| As time | 49959 seconds = 13 h 52 min 39 s |
Is 49959 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 (49959 ÷ 3 = 16653) | 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 4) | 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 (49959 ÷ 7 = 7137) | 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 | Yes (49959 ÷ 9 = 5551) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 49959 a prime number?
No. 49959 = × 7 × 13 × 61, so it is divisible by 3.
What are the factors of 49959?
1, 3, 7, 9, 13, 21, 39, 61, 63, 91, 117, 183, 273, 427, 549, 793, 819, 1281, 2379, 3843, 5551, 7137, 16653, 49959.
What is 49959 in binary?
1100001100100111 (hexadecimal C327, octal 141447).
What is the square root of 49959?
About 223.5151, exactly 3√5551.
Is 49959 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 49959?
It is a composite number with 24 divisors.