The number 1048
1048 is a composite number with 8 divisors. Its prime factorisation is × 131. Divisors (8): 1, 2, 4, 8, 131, 262, 524, 1048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1048 is composite. Its prime factorisation is
- 3
The divisors add up to 1980; without 1048 itself that is 932, so 1048 is deficient (932 is less than 1048). Euler's totient φ(1048) = 520 numbers up to 1048 share no factor with it.
- 4
The digits of 1048 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1048 = 2^{3} \times 131 \]1048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1980 |
| Euler totient φ(n) | 520 |
| Square | 1098304 |
| Cube | 1151022592 |
| Square root | 32.372828 (= 2√262) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.048 × |
1048 in other forms
| Form | Value |
|---|---|
| In words | one thousand and forty-eight |
| Roman numerals | MXLVIII |
| Binary (base 2) | 10000011000 |
| Octal (base 8) | 2030 |
| Hexadecimal (base 16) | 418 |
| Base 3 | 1102211 |
| As time | 1048 seconds = 17 min 28 s |
Is 1048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1048 ÷ 2 = 524) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1048 ÷ 4 = 262) | 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 4) | 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 | Yes (1048 ÷ 8 = 131) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1048 a prime number?
No. 1048 = × 131, so it is divisible by 2.
What are the factors of 1048?
1, 2, 4, 8, 131, 262, 524, 1048.
What is 1048 in binary?
10000011000 (hexadecimal 418, octal 2030).
What is the square root of 1048?
About 32.3728, exactly 2√262.
What is 1048 in Roman numerals?
MXLVIII.
Is 1048 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1048?
It is a composite number with 8 divisors.