The number 49513
49513 is a composite number with 4 divisors. Its prime factorisation is 67 × 739. Divisors (4): 1, 67, 739, 49513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49513: a semiprime: 67 × 739, the product of two primes.
- 2
49513 is composite. Its prime factorisation is
- 3
The divisors add up to 50320; without 49513 itself that is 807, so 49513 is deficient (807 is less than 49513). Euler's totient φ(49513) = 48708 numbers up to 49513 share no factor with it.
- 4
The digits of 49513 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49513 = 67 \times 739 \]
49513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50320 |
| Euler totient φ(n) | 48708 |
| Square | 2451537169 |
| Cube | 121382959848697 |
| Square root | 222.515168 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9513 × |
49513 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and thirteen |
| Binary (base 2) | 1100000101101001 |
| Octal (base 8) | 140551 |
| Hexadecimal (base 16) | C169 |
| Base 3 | 2111220211 |
| As time | 49513 seconds = 13 h 45 min 13 s |
Is 49513 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 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 1) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49513 a prime number?
No. 49513 = 67 × 739, so it is divisible by 67.
What are the factors of 49513?
1, 67, 739, 49513.
What is 49513 in binary?
1100000101101001 (hexadecimal C169, octal 140551).
What is the square root of 49513?
About 222.5152.
Is 49513 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49513?
49513 is a semiprime: 67 × 739, the product of two primes.