The number 1148
1148 is a composite number with 12 divisors. Its prime factorisation is × 7 × 41. Divisors (12): 1, 2, 4, 7, 14, 28, 41, 82, 164, 287, 574, 1148.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1148: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.
- 2
1148 is composite. Its prime factorisation is
- 3
The divisors add up to 2352; without 1148 itself that is 1204, so 1148 is abundant (1204 is more than 1148). Euler's totient φ(1148) = 480 numbers up to 1148 share no factor with it.
- 4
The digits of 1148 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 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1148 = 2^{2} \times 7 \times 41 \]1148 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 2352 |
| Euler totient φ(n) | 480 |
| Square | 1317904 |
| Cube | 1512953792 |
| Square root | 33.882149 (= 2√287) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 44 |
| Scientific notation | 1.148 × |
1148 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and forty-eight |
| Roman numerals | MCXLVIII |
| Binary (base 2) | 10001111100 |
| Octal (base 8) | 2174 |
| Hexadecimal (base 16) | 47C |
| Base 3 | 1120112 |
| As time | 1148 seconds = 19 min 8 s |
Is 1148 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1148 ÷ 2 = 574) | 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 (1148 ÷ 4 = 287) | 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 | Yes (1148 ÷ 7 = 164) | 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 4) | 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 1148 a prime number?
No. 1148 = × 7 × 41, so it is divisible by 2.
What are the factors of 1148?
1, 2, 4, 7, 14, 28, 41, 82, 164, 287, 574, 1148.
What is 1148 in binary?
10001111100 (hexadecimal 47C, octal 2174).
What is the square root of 1148?
About 33.8821, exactly 2√287.
What is 1148 in Roman numerals?
MCXLVIII.
Is 1148 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1148?
1148 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.