The number 1505
1505 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 43. Divisors (8): 1, 5, 7, 35, 43, 215, 301, 1505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1505 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1505 is composite. Its prime factorisation is
- 3
The divisors add up to 2112; without 1505 itself that is 607, so 1505 is deficient (607 is less than 1505). Euler's totient φ(1505) = 1008 numbers up to 1505 share no factor with it.
- 4
The digits of 1505 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1505 = 5 \times 7 \times 43 \]
1505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2112 |
| Euler totient φ(n) | 1008 |
| Square | 2265025 |
| Cube | 3408862625 |
| Square root | 38.794329 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.505 × |
1505 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and five |
| Roman numerals | MDV |
| Binary (base 2) | 10111100001 |
| Octal (base 8) | 2741 |
| Hexadecimal (base 16) | 5E1 |
| Base 3 | 2001202 |
| As time | 1505 seconds = 25 min 5 s |
Is 1505 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 | Yes (1505 ÷ 5 = 301) | 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 | Yes (1505 ÷ 7 = 215) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 1505 a prime number?
No. 1505 = 5 × 7 × 43, so it is divisible by 5.
What are the factors of 1505?
1, 5, 7, 35, 43, 215, 301, 1505.
What is 1505 in binary?
10111100001 (hexadecimal 5E1, octal 2741).
What is the square root of 1505?
About 38.7943.
What is 1505 in Roman numerals?
MDV.
Is 1505 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1505?
It is a composite number with 8 divisors.