The number 1515
1515 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 101. Divisors (8): 1, 3, 5, 15, 101, 303, 505, 1515.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1515 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1515 is composite. Its prime factorisation is
- 3
The divisors add up to 2448; without 1515 itself that is 933, so 1515 is deficient (933 is less than 1515). Euler's totient φ(1515) = 800 numbers up to 1515 share no factor with it.
- 4
The digits of 1515 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1515 = 3 \times 5 \times 101 \]
1515 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2448 |
| Euler totient φ(n) | 800 |
| Square | 2295225 |
| Cube | 3477265875 |
| Square root | 38.923001 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 140 |
| Scientific notation | 1.515 × |
1515 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and fifteen |
| Roman numerals | MDXV |
| Binary (base 2) | 10111101011 |
| Octal (base 8) | 2753 |
| Hexadecimal (base 16) | 5EB |
| Base 3 | 2002010 |
| As time | 1515 seconds = 25 min 15 s |
Is 1515 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 | Yes (1515 ÷ 3 = 505) | 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 | Yes (1515 ÷ 5 = 303) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1515 a prime number?
No. 1515 = 3 × 5 × 101, so it is divisible by 3.
What are the factors of 1515?
1, 3, 5, 15, 101, 303, 505, 1515.
What is 1515 in binary?
10111101011 (hexadecimal 5EB, octal 2753).
What is the square root of 1515?
About 38.9230.
What is 1515 in Roman numerals?
MDXV.
Is 1515 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1515?
It is a composite number with 8 divisors.