The number 1507
1507 is a composite number with 4 divisors. Its prime factorisation is 11 × 137. Divisors (4): 1, 11, 137, 1507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1507: a semiprime: 11 × 137, the product of two primes.
- 2
1507 is composite. Its prime factorisation is
- 3
The divisors add up to 1656; without 1507 itself that is 149, so 1507 is deficient (149 is less than 1507). Euler's totient φ(1507) = 1360 numbers up to 1507 share no factor with it.
- 4
The digits of 1507 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 21 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1507 = 11 \times 137 \]
1507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1656 |
| Euler totient φ(n) | 1360 |
| Square | 2271049 |
| Cube | 3422470843 |
| Square root | 38.820098 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 21 |
| Scientific notation | 1.507 × |
1507 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and seven |
| Roman numerals | MDVII |
| Binary (base 2) | 10111100011 |
| Octal (base 8) | 2743 |
| Hexadecimal (base 16) | 5E3 |
| Base 3 | 2001211 |
| As time | 1507 seconds = 25 min 7 s |
Is 1507 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 2) | 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 4) | 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 | Yes (1507 ÷ 11 = 137) | 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 1507 a prime number?
No. 1507 = 11 × 137, so it is divisible by 11.
What are the factors of 1507?
1, 11, 137, 1507.
What is 1507 in binary?
10111100011 (hexadecimal 5E3, octal 2743).
What is the square root of 1507?
About 38.8201.
What is 1507 in Roman numerals?
MDVII.
Is 1507 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1507?
1507 is a semiprime: 11 × 137, the product of two primes.