The number 61513
61513 is a composite number with 4 divisors. Its prime factorisation is 137 × 449. Divisors (4): 1, 137, 449, 61513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61513: a semiprime: 137 × 449, the product of two primes.
- 2
61513 is composite. Its prime factorisation is
- 3
The divisors add up to 62100; without 61513 itself that is 587, so 61513 is deficient (587 is less than 61513). Euler's totient φ(61513) = 60928 numbers up to 61513 share no factor with it.
- 4
The digits of 61513 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61513 = 137 \times 449 \]
61513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62100 |
| Euler totient φ(n) | 60928 |
| Square | 3783849169 |
| Cube | 232755913932697 |
| Square root | 248.018144 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1513 × |
61513 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and thirteen |
| Binary (base 2) | 1111000001001001 |
| Octal (base 8) | 170111 |
| Hexadecimal (base 16) | F049 |
| Base 3 | 10010101021 |
| As time | 61513 seconds = 17 h 5 min 13 s |
Is 61513 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 4) | 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 7) | 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 1) | 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 61513 a prime number?
No. 61513 = 137 × 449, so it is divisible by 137.
What are the factors of 61513?
1, 137, 449, 61513.
What is 61513 in binary?
1111000001001001 (hexadecimal F049, octal 170111).
What is the square root of 61513?
About 248.0181.
Is 61513 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 61513?
61513 is a semiprime: 137 × 449, the product of two primes.