The number 61035
61035 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 13 × 313. Divisors (16): 1, 3, 5, 13, 15, 39, 65, 195, 313, 939, 1565, 4069, 4695, 12207, 20345, 61035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61035: a Harshad number: divisible by its digit sum 15.
- 2
61035 is composite. Its prime factorisation is
- 3
The divisors add up to 105504; without 61035 itself that is 44469, so 61035 is deficient (44469 is less than 61035). Euler's totient φ(61035) = 29952 numbers up to 61035 share no factor with it.
- 4
The digits of 61035 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61035 = 3 \times 5 \times 13 \times 313 \]
61035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 105504 |
| Euler totient φ(n) | 29952 |
| Square | 3725271225 |
| Cube | 227371929217875 |
| Square root | 247.052626 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.1035 × |
61035 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand and thirty-five |
| Binary (base 2) | 1110111001101011 |
| Octal (base 8) | 167153 |
| Hexadecimal (base 16) | EE6B |
| Base 3 | 10002201120 |
| As time | 61035 seconds = 16 h 57 min 15 s |
Is 61035 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 | Yes (61035 ÷ 3 = 20345) | 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 | Yes (61035 ÷ 5 = 12207) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61035 a prime number?
No. 61035 = 3 × 5 × 13 × 313, so it is divisible by 3.
What are the factors of 61035?
1, 3, 5, 13, 15, 39, 65, 195, 313, 939, 1565, 4069, 4695, 12207, 20345, 61035.
What is 61035 in binary?
1110111001101011 (hexadecimal EE6B, octal 167153).
What is the square root of 61035?
About 247.0526.
Is 61035 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 61035?
61035 is a Harshad number: divisible by its digit sum 15.