The number 61259
61259 is a composite number with 4 divisors. Its prime factorisation is 11 × 5569. Divisors (4): 1, 11, 5569, 61259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61259: a semiprime: 11 × 5569, the product of two primes.
- 2
61259 is composite. Its prime factorisation is
- 3
The divisors add up to 66840; without 61259 itself that is 5581, so 61259 is deficient (5581 is less than 61259). Euler's totient φ(61259) = 55680 numbers up to 61259 share no factor with it.
- 4
The digits of 61259 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61259 = 11 \times 5569 \]
61259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66840 |
| Euler totient φ(n) | 55680 |
| Square | 3752665081 |
| Cube | 229884510196979 |
| Square root | 247.505555 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.1259 × |
61259 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand two hundred and fifty-nine |
| Binary (base 2) | 1110111101001011 |
| Octal (base 8) | 167513 |
| Hexadecimal (base 16) | EF4B |
| Base 3 | 10010000212 |
| As time | 61259 seconds = 17 h 0 min 59 s |
Is 61259 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 4) | 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 | No (remainder 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (61259 ÷ 11 = 5569) | 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 61259 a prime number?
No. 61259 = 11 × 5569, so it is divisible by 11.
What are the factors of 61259?
1, 11, 5569, 61259.
What is 61259 in binary?
1110111101001011 (hexadecimal EF4B, octal 167513).
What is the square root of 61259?
About 247.5056.
Is 61259 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 61259?
61259 is a semiprime: 11 × 5569, the product of two primes.