The number 16513
16513 is a binary palindrome (100000010000001). Its prime factorisation is Ć 337. Divisors (6): 1, 7, 49, 337, 2359, 16513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16513: a binary palindrome (100000010000001).
- 2
16513 is composite. Its prime factorisation is
- 3
The divisors add up to 19266; without 16513 itself that is 2753, so 16513 is deficient (2753 is less than 16513). Euler's totient Ļ(16513) = 14112 numbers up to 16513 share no factor with it.
- 4
The digits of 16513 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16513 = 7^{2} \times 337 \]16513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 19266 |
| Euler totient Ļ(n) | 14112 |
| Square | 272679169 |
| Cube | 4502751117697 |
| Square root | 128.502918 (= 7ā337) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.6513 Ć |
16513 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and thirteen |
| Binary (base 2) | 100000010000001 |
| Octal (base 8) | 40201 |
| Hexadecimal (base 16) | 4081 |
| Base 3 | 211122121 |
| As time | 16513 seconds = 4 h 35 min 13 s |
Is 16513 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 | Yes (16513 Ć· 7 = 2359) | 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 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 16513 a prime number?
No. 16513 = Ć 337, so it is divisible by 7.
What are the factors of 16513?
1, 7, 49, 337, 2359, 16513.
What is 16513 in binary?
100000010000001 (hexadecimal 4081, octal 40201).
What is the square root of 16513?
About 128.5029, exactly 7ā337.
Is 16513 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 16513?
16513 is a binary palindrome (100000010000001).