The number 11507
11507 is a composite number with 4 divisors. Its prime factorisation is 37 × 311. Divisors (4): 1, 37, 311, 11507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11507: a semiprime: 37 × 311, the product of two primes.
- 2
11507 is composite. Its prime factorisation is
- 3
The divisors add up to 11856; without 11507 itself that is 349, so 11507 is deficient (349 is less than 11507). Euler's totient φ(11507) = 11160 numbers up to 11507 share no factor with it.
- 4
The digits of 11507 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11507 = 37 \times 311 \]
11507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11856 |
| Euler totient φ(n) | 11160 |
| Square | 132411049 |
| Cube | 1523653940843 |
| Square root | 107.270686 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1507 × |
11507 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and seven |
| Binary (base 2) | 10110011110011 |
| Octal (base 8) | 26363 |
| Hexadecimal (base 16) | 2CF3 |
| Base 3 | 120210012 |
| As time | 11507 seconds = 3 h 11 min 47 s |
Is 11507 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11507 a prime number?
No. 11507 = 37 × 311, so it is divisible by 37.
What are the factors of 11507?
1, 37, 311, 11507.
What is 11507 in binary?
10110011110011 (hexadecimal 2CF3, octal 26363).
What is the square root of 11507?
About 107.2707.
Is 11507 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11507?
11507 is a semiprime: 37 × 311, the product of two primes.