The number 49713
49713 is a composite number with 8 divisors. Its prime factorisation is 3 × 73 × 227. Divisors (8): 1, 3, 73, 219, 227, 681, 16571, 49713.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49713 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49713 is composite. Its prime factorisation is
- 3
The divisors add up to 67488; without 49713 itself that is 17775, so 49713 is deficient (17775 is less than 49713). Euler's totient φ(49713) = 32544 numbers up to 49713 share no factor with it.
- 4
The digits of 49713 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49713 = 3 \times 73 \times 227 \]
49713 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67488 |
| Euler totient φ(n) | 32544 |
| Square | 2471382369 |
| Cube | 122859831710097 |
| Square root | 222.964123 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9713 × |
49713 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and thirteen |
| Binary (base 2) | 1100001000110001 |
| Octal (base 8) | 141061 |
| Hexadecimal (base 16) | C231 |
| Base 3 | 2112012020 |
| As time | 49713 seconds = 13 h 48 min 33 s |
Is 49713 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 (49713 ÷ 3 = 16571) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 6) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49713 a prime number?
No. 49713 = 3 × 73 × 227, so it is divisible by 3.
What are the factors of 49713?
1, 3, 73, 219, 227, 681, 16571, 49713.
What is 49713 in binary?
1100001000110001 (hexadecimal C231, octal 141061).
What is the square root of 49713?
About 222.9641.
Is 49713 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49713?
It is a composite number with 8 divisors.