The number 61048
61048 is a composite number with 16 divisors. Its prime factorisation is × 13 × 587. Divisors (16): 1, 2, 4, 8, 13, 26, 52, 104, 587, 1174, 2348, 4696, 7631, 15262, 30524, 61048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61048 is composite. Its prime factorisation is
- 3
The divisors add up to 123480; without 61048 itself that is 62432, so 61048 is abundant (62432 is more than 61048). Euler's totient φ(61048) = 28128 numbers up to 61048 share no factor with it.
- 4
The digits of 61048 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61048 = 2^{3} \times 13 \times 587 \]61048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 123480 |
| Euler totient φ(n) | 28128 |
| Square | 3726858304 |
| Cube | 227517245742592 |
| Square root | 247.078935 (= 2√15262) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1048 × |
61048 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand and forty-eight |
| Binary (base 2) | 1110111001111000 |
| Octal (base 8) | 167170 |
| Hexadecimal (base 16) | EE78 |
| Base 3 | 10002202001 |
| As time | 61048 seconds = 16 h 57 min 28 s |
Is 61048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61048 ÷ 2 = 30524) | 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 (61048 ÷ 4 = 15262) | 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 1) | 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 (61048 ÷ 8 = 7631) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 9) | 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 61048 a prime number?
No. 61048 = × 13 × 587, so it is divisible by 2.
What are the factors of 61048?
1, 2, 4, 8, 13, 26, 52, 104, 587, 1174, 2348, 4696, 7631, 15262, 30524, 61048.
What is 61048 in binary?
1110111001111000 (hexadecimal EE78, octal 167170).
What is the square root of 61048?
About 247.0789, exactly 2√15262.
Is 61048 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 61048?
It is a composite number with 16 divisors.