The number 68513
68513 is a binary palindrome (10000101110100001). Its prime factorisation is 131 × 523. Divisors (4): 1, 131, 523, 68513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 68513: a binary palindrome (10000101110100001); a semiprime: 131 × 523, the product of two primes.
- 2
68513 is composite. Its prime factorisation is
- 3
The divisors add up to 69168; without 68513 itself that is 655, so 68513 is deficient (655 is less than 68513). Euler's totient φ(68513) = 67860 numbers up to 68513 share no factor with it.
- 4
The digits of 68513 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68513 = 131 \times 523 \]
68513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 69168 |
| Euler totient φ(n) | 67860 |
| Square | 4694031169 |
| Cube | 321602157481697 |
| Square root | 261.749881 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.8513 × |
68513 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand five hundred and thirteen |
| Binary (base 2) | 10000101110100001 |
| Octal (base 8) | 205641 |
| Hexadecimal (base 16) | 10BA1 |
| Base 3 | 10110222112 |
| As time | 68513 seconds = 19 h 1 min 53 s |
Is 68513 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 2) | 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 5) | 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 5) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68513 a prime number?
No. 68513 = 131 × 523, so it is divisible by 131.
What are the factors of 68513?
1, 131, 523, 68513.
What is 68513 in binary?
10000101110100001 (hexadecimal 10BA1, octal 205641).
What is the square root of 68513?
About 261.7499.
Is 68513 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 68513?
68513 is a binary palindrome (10000101110100001); a semiprime: 131 × 523, the product of two primes.