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