The number 61531
61531 is a composite number with 4 divisors. Its prime factorisation is 37 × 1663. Divisors (4): 1, 37, 1663, 61531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61531: a semiprime: 37 × 1663, the product of two primes.
- 2
61531 is composite. Its prime factorisation is
- 3
The divisors add up to 63232; without 61531 itself that is 1701, so 61531 is deficient (1701 is less than 61531). Euler's totient φ(61531) = 59832 numbers up to 61531 share no factor with it.
- 4
The digits of 61531 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61531 = 37 \times 1663 \]
61531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63232 |
| Euler totient φ(n) | 59832 |
| Square | 3786063961 |
| Cube | 232960301584291 |
| Square root | 248.054430 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.1531 × |
61531 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and thirty-one |
| Binary (base 2) | 1111000001011011 |
| Octal (base 8) | 170133 |
| Hexadecimal (base 16) | F05B |
| Base 3 | 10010101221 |
| As time | 61531 seconds = 17 h 5 min 31 s |
Is 61531 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 | 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 1) | 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 7) | 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 8) | 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 61531 a prime number?
No. 61531 = 37 × 1663, so it is divisible by 37.
What are the factors of 61531?
1, 37, 1663, 61531.
What is 61531 in binary?
1111000001011011 (hexadecimal F05B, octal 170133).
What is the square root of 61531?
About 248.0544.
Is 61531 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 61531?
61531 is a semiprime: 37 × 1663, the product of two primes.