The number 1508
1508 is a composite number with 12 divisors. Its prime factorisation is × 13 × 29. Divisors (12): 1, 2, 4, 13, 26, 29, 52, 58, 116, 377, 754, 1508.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1508 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1508 is composite. Its prime factorisation is
- 3
The divisors add up to 2940; without 1508 itself that is 1432, so 1508 is deficient (1432 is less than 1508). Euler's totient φ(1508) = 672 numbers up to 1508 share no factor with it.
- 4
The digits of 1508 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1508 = 2^{2} \times 13 \times 29 \]1508 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2940 |
| Euler totient φ(n) | 672 |
| Square | 2274064 |
| Cube | 3429288512 |
| Square root | 38.832976 (= 2√377) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 1.508 × |
1508 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and eight |
| Roman numerals | MDVIII |
| Binary (base 2) | 10111100100 |
| Octal (base 8) | 2744 |
| Hexadecimal (base 16) | 5E4 |
| Base 3 | 2001212 |
| As time | 1508 seconds = 25 min 8 s |
Is 1508 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1508 ÷ 2 = 754) | 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 | Yes (1508 ÷ 4 = 377) | 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 2) | 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 4) | 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 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1508 a prime number?
No. 1508 = × 13 × 29, so it is divisible by 2.
What are the factors of 1508?
1, 2, 4, 13, 26, 29, 52, 58, 116, 377, 754, 1508.
What is 1508 in binary?
10111100100 (hexadecimal 5E4, octal 2744).
What is the square root of 1508?
About 38.8330, exactly 2√377.
What is 1508 in Roman numerals?
MDVIII.
Is 1508 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1508?
It is a composite number with 12 divisors.