The number 1513
1513 is a composite number with 4 divisors. Its prime factorisation is 17 × 89. Divisors (4): 1, 17, 89, 1513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1513: a semiprime: 17 × 89, the product of two primes.
- 2
1513 is composite. Its prime factorisation is
- 3
The divisors add up to 1620; without 1513 itself that is 107, so 1513 is deficient (107 is less than 1513). Euler's totient φ(1513) = 1408 numbers up to 1513 share no factor with it.
- 4
The digits of 1513 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1513 = 17 \times 89 \]
1513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1620 |
| Euler totient φ(n) | 1408 |
| Square | 2289169 |
| Cube | 3463512697 |
| Square root | 38.897301 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 1.513 × |
1513 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and thirteen |
| Roman numerals | MDXIII |
| Binary (base 2) | 10111101001 |
| Octal (base 8) | 2751 |
| Hexadecimal (base 16) | 5E9 |
| Base 3 | 2002001 |
| As time | 1513 seconds = 25 min 13 s |
Is 1513 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 1) | 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 1) | 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 6) | 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 1513 a prime number?
No. 1513 = 17 × 89, so it is divisible by 17.
What are the factors of 1513?
1, 17, 89, 1513.
What is 1513 in binary?
10111101001 (hexadecimal 5E9, octal 2751).
What is the square root of 1513?
About 38.8973.
What is 1513 in Roman numerals?
MDXIII.
Is 1513 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1513?
1513 is a semiprime: 17 × 89, the product of two primes.