The number 49495
49495 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 521. Divisors (8): 1, 5, 19, 95, 521, 2605, 9899, 49495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49495: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49495 is composite. Its prime factorisation is
- 3
The divisors add up to 62640; without 49495 itself that is 13145, so 49495 is deficient (13145 is less than 49495). Euler's totient φ(49495) = 37440 numbers up to 49495 share no factor with it.
- 4
The digits of 49495 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49495 = 5 \times 19 \times 521 \]
49495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62640 |
| Euler totient φ(n) | 37440 |
| Square | 2449755025 |
| Cube | 121250624962375 |
| Square root | 222.474718 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9495 × |
49495 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and ninety-five |
| Binary (base 2) | 1100000101010111 |
| Octal (base 8) | 140527 |
| Hexadecimal (base 16) | C157 |
| Base 3 | 2111220011 |
| As time | 49495 seconds = 13 h 44 min 55 s |
Is 49495 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 | No (remainder 1) | 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 (49495 ÷ 5 = 9899) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49495 a prime number?
No. 49495 = 5 × 19 × 521, so it is divisible by 5.
What are the factors of 49495?
1, 5, 19, 95, 521, 2605, 9899, 49495.
What is 49495 in binary?
1100000101010111 (hexadecimal C157, octal 140527).
What is the square root of 49495?
About 222.4747.
Is 49495 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 49495?
49495 is a happy number: repeatedly adding the squares of its digits reaches 1.