The number 61435
61435 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 1117. Divisors (8): 1, 5, 11, 55, 1117, 5585, 12287, 61435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61435 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61435 is composite. Its prime factorisation is
- 3
The divisors add up to 80496; without 61435 itself that is 19061, so 61435 is deficient (19061 is less than 61435). Euler's totient φ(61435) = 44640 numbers up to 61435 share no factor with it.
- 4
The digits of 61435 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
\[ 61435 = 5 \times 11 \times 1117 \]
61435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80496 |
| Euler totient φ(n) | 44640 |
| Square | 3774259225 |
| Cube | 231871615487875 |
| Square root | 247.860848 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.1435 × |
61435 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand four hundred and thirty-five |
| Binary (base 2) | 1110111111111011 |
| Octal (base 8) | 167773 |
| Hexadecimal (base 16) | EFFB |
| Base 3 | 10010021101 |
| As time | 61435 seconds = 17 h 3 min 55 s |
Is 61435 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 1) | 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 (61435 ÷ 5 = 12287) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 | Yes (61435 ÷ 11 = 5585) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61435 a prime number?
No. 61435 = 5 × 11 × 1117, so it is divisible by 5.
What are the factors of 61435?
1, 5, 11, 55, 1117, 5585, 12287, 61435.
What is 61435 in binary?
1110111111111011 (hexadecimal EFFB, octal 167773).
What is the square root of 61435?
About 247.8608.
Is 61435 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 61435?
It is a composite number with 8 divisors.