The number 49695
49695 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3313. Divisors (8): 1, 3, 5, 15, 3313, 9939, 16565, 49695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49695: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49695 is composite. Its prime factorisation is
- 3
The divisors add up to 79536; without 49695 itself that is 29841, so 49695 is deficient (29841 is less than 49695). Euler's totient φ(49695) = 26496 numbers up to 49695 share no factor with it.
- 4
The digits of 49695 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49695 = 3 \times 5 \times 3313 \]
49695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79536 |
| Euler totient φ(n) | 26496 |
| Square | 2469593025 |
| Cube | 122726425377375 |
| Square root | 222.923754 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9695 × |
49695 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and ninety-five |
| Binary (base 2) | 1100001000011111 |
| Octal (base 8) | 141037 |
| Hexadecimal (base 16) | C21F |
| Base 3 | 2112011120 |
| As time | 49695 seconds = 13 h 48 min 15 s |
Is 49695 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 (49695 ÷ 3 = 16565) | 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 (49695 ÷ 5 = 9939) | 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 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 7) | 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 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 49695 a prime number?
No. 49695 = 3 × 5 × 3313, so it is divisible by 3.
What are the factors of 49695?
1, 3, 5, 15, 3313, 9939, 16565, 49695.
What is 49695 in binary?
1100001000011111 (hexadecimal C21F, octal 141037).
What is the square root of 49695?
About 222.9238.
Is 49695 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 49695?
49695 is a happy number: repeatedly adding the squares of its digits reaches 1.