The number 13507
13507 is a composite number with 4 divisors. Its prime factorisation is 13 × 1039. Divisors (4): 1, 13, 1039, 13507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13507: a semiprime: 13 × 1039, the product of two primes.
- 2
13507 is composite. Its prime factorisation is
- 3
The divisors add up to 14560; without 13507 itself that is 1053, so 13507 is deficient (1053 is less than 13507). Euler's totient φ(13507) = 12456 numbers up to 13507 share no factor with it.
- 4
The digits of 13507 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13507 = 13 \times 1039 \]
13507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14560 |
| Euler totient φ(n) | 12456 |
| Square | 182439049 |
| Cube | 2464204234843 |
| Square root | 116.219620 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.3507 × |
13507 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand five hundred and seven |
| Binary (base 2) | 11010011000011 |
| Octal (base 8) | 32303 |
| Hexadecimal (base 16) | 34C3 |
| Base 3 | 200112021 |
| As time | 13507 seconds = 3 h 45 min 7 s |
Is 13507 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13507 a prime number?
No. 13507 = 13 × 1039, so it is divisible by 13.
What are the factors of 13507?
1, 13, 1039, 13507.
What is 13507 in binary?
11010011000011 (hexadecimal 34C3, octal 32303).
What is the square root of 13507?
About 116.2196.
Is 13507 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 13507?
13507 is a semiprime: 13 × 1039, the product of two primes.