The number 1547
1547 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 17. Divisors (8): 1, 7, 13, 17, 91, 119, 221, 1547.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1547: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
1547 is composite. Its prime factorisation is
- 3
The divisors add up to 2016; without 1547 itself that is 469, so 1547 is deficient (469 is less than 1547). Euler's totient φ(1547) = 1152 numbers up to 1547 share no factor with it.
- 4
The digits of 1547 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1547 = 7 \times 13 \times 17 \]
1547 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2016 |
| Euler totient φ(n) | 1152 |
| Square | 2393209 |
| Cube | 3702294323 |
| Square root | 39.331921 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.547 × |
1547 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and forty-seven |
| Roman numerals | MDXLVII |
| Binary (base 2) | 11000001011 |
| Octal (base 8) | 3013 |
| Hexadecimal (base 16) | 60B |
| Base 3 | 2010022 |
| As time | 1547 seconds = 25 min 47 s |
Is 1547 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (1547 ÷ 7 = 221) | 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 8) | 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 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1547 a prime number?
No. 1547 = 7 × 13 × 17, so it is divisible by 7.
What are the factors of 1547?
1, 7, 13, 17, 91, 119, 221, 1547.
What is 1547 in binary?
11000001011 (hexadecimal 60B, octal 3013).
What is the square root of 1547?
About 39.3319.
What is 1547 in Roman numerals?
MDXLVII.
Is 1547 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1547?
1547 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.