The number 61501
61501 is a composite number with 4 divisors. Its prime factorisation is 11 × 5591. Divisors (4): 1, 11, 5591, 61501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61501: a semiprime: 11 × 5591, the product of two primes.
- 2
61501 is composite. Its prime factorisation is
- 3
The divisors add up to 67104; without 61501 itself that is 5603, so 61501 is deficient (5603 is less than 61501). Euler's totient φ(61501) = 55900 numbers up to 61501 share no factor with it.
- 4
The digits of 61501 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61501 = 11 \times 5591 \]
61501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67104 |
| Euler totient φ(n) | 55900 |
| Square | 3782373001 |
| Cube | 232619721934501 |
| Square root | 247.993952 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 6.1501 × |
61501 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and one |
| Binary (base 2) | 1111000000111101 |
| Octal (base 8) | 170075 |
| Hexadecimal (base 16) | F03D |
| Base 3 | 10010100211 |
| As time | 61501 seconds = 17 h 5 min 1 s |
Is 61501 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (61501 ÷ 11 = 5591) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61501 a prime number?
No. 61501 = 11 × 5591, so it is divisible by 11.
What are the factors of 61501?
1, 11, 5591, 61501.
What is 61501 in binary?
1111000000111101 (hexadecimal F03D, octal 170075).
What is the square root of 61501?
About 247.9940.
Is 61501 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 61501?
61501 is a semiprime: 11 × 5591, the product of two primes.