The number 1503
1503 is a composite number with 6 divisors. Its prime factorisation is × 167. Divisors (6): 1, 3, 9, 167, 501, 1503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1503: a Harshad number: divisible by its digit sum 9.
- 2
1503 is composite. Its prime factorisation is
- 3
The divisors add up to 2184; without 1503 itself that is 681, so 1503 is deficient (681 is less than 1503). Euler's totient φ(1503) = 996 numbers up to 1503 share no factor with it.
- 4
The digits of 1503 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1503 = 3^{2} \times 167 \]1503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2184 |
| Euler totient φ(n) | 996 |
| Square | 2259009 |
| Cube | 3395290527 |
| Square root | 38.768544 (= 3√167) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 1.503 × |
1503 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and three |
| Roman numerals | MDIII |
| Binary (base 2) | 10111011111 |
| Octal (base 8) | 2737 |
| Hexadecimal (base 16) | 5DF |
| Base 3 | 2001200 |
| As time | 1503 seconds = 25 min 3 s |
Is 1503 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 (1503 ÷ 3 = 501) | 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 3) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1503 ÷ 9 = 167) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 1503 a prime number?
No. 1503 = × 167, so it is divisible by 3.
What are the factors of 1503?
1, 3, 9, 167, 501, 1503.
What is 1503 in binary?
10111011111 (hexadecimal 5DF, octal 2737).
What is the square root of 1503?
About 38.7685, exactly 3√167.
What is 1503 in Roman numerals?
MDIII.
Is 1503 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 1503?
1503 is a Harshad number: divisible by its digit sum 9.