The number 49995
49995 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 101. Divisors (24): 1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 101, 165, 303, 495, 505, 909 … 49995.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49995 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49995 is composite. Its prime factorisation is
- 3
The divisors add up to 95472; without 49995 itself that is 45477, so 49995 is deficient (45477 is less than 49995). Euler's totient φ(49995) = 24000 numbers up to 49995 share no factor with it.
- 4
The digits of 49995 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49995 = 3^{2} \times 5 \times 11 \times 101 \]49995 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 95472 |
| Euler totient φ(n) | 24000 |
| Square | 2499500025 |
| Cube | 124962503749875 |
| Square root | 223.595617 (= 3√5555) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9995 × |
49995 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand nine hundred and ninety-five |
| Binary (base 2) | 1100001101001011 |
| Octal (base 8) | 141513 |
| Hexadecimal (base 16) | C34B |
| Base 3 | 2112120200 |
| As time | 49995 seconds = 13 h 53 min 15 s |
Is 49995 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 (49995 ÷ 3 = 16665) | 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 (49995 ÷ 5 = 9999) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (49995 ÷ 9 = 5555) | 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 | Yes (49995 ÷ 11 = 4545) | 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 49995 a prime number?
No. 49995 = × 5 × 11 × 101, so it is divisible by 3.
What are the factors of 49995?
1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 101, 165, 303, 495, 505, 909, 1111, 1515, 3333, 4545, 5555, 9999, 16665, 49995.
What is 49995 in binary?
1100001101001011 (hexadecimal C34B, octal 141513).
What is the square root of 49995?
About 223.5956, exactly 3√5555.
Is 49995 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 49995?
It is a composite number with 24 divisors.