The number 61502
61502 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 23 × 191. Divisors (16): 1, 2, 7, 14, 23, 46, 161, 191, 322, 382, 1337, 2674, 4393, 8786, 30751, 61502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61502: a Harshad number: divisible by its digit sum 14.
- 2
61502 is composite. Its prime factorisation is
- 3
The divisors add up to 110592; without 61502 itself that is 49090, so 61502 is deficient (49090 is less than 61502). Euler's totient φ(61502) = 25080 numbers up to 61502 share no factor with it.
- 4
The digits of 61502 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61502 = 2 \times 7 \times 23 \times 191 \]
61502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 110592 |
| Euler totient φ(n) | 25080 |
| Square | 3782496004 |
| Cube | 232631069238008 |
| Square root | 247.995968 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 104 |
| Scientific notation | 6.1502 × |
61502 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and two |
| Binary (base 2) | 1111000000111110 |
| Octal (base 8) | 170076 |
| Hexadecimal (base 16) | F03E |
| Base 3 | 10010100212 |
| As time | 61502 seconds = 17 h 5 min 2 s |
Is 61502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61502 ÷ 2 = 30751) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (61502 ÷ 7 = 8786) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61502 a prime number?
No. 61502 = 2 × 7 × 23 × 191, so it is divisible by 2.
What are the factors of 61502?
1, 2, 7, 14, 23, 46, 161, 191, 322, 382, 1337, 2674, 4393, 8786, 30751, 61502.
What is 61502 in binary?
1111000000111110 (hexadecimal F03E, octal 170076).
What is the square root of 61502?
About 247.9960.
Is 61502 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 61502?
61502 is a Harshad number: divisible by its digit sum 14.