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