The number 61532
61532 is a composite number with 6 divisors. Its prime factorisation is × 15383. Divisors (6): 1, 2, 4, 15383, 30766, 61532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61532 is composite. Its prime factorisation is
- 3
The divisors add up to 107688; without 61532 itself that is 46156, so 61532 is deficient (46156 is less than 61532). Euler's totient φ(61532) = 30764 numbers up to 61532 share no factor with it.
- 4
The digits of 61532 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61532 = 2^{2} \times 15383 \]61532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 107688 |
| Euler totient φ(n) | 30764 |
| Square | 3786187024 |
| Cube | 232971659960768 |
| Square root | 248.056445 (= 2√15383) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.1532 × |
61532 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and thirty-two |
| Binary (base 2) | 1111000001011100 |
| Octal (base 8) | 170134 |
| Hexadecimal (base 16) | F05C |
| Base 3 | 10010101222 |
| As time | 61532 seconds = 17 h 5 min 32 s |
Is 61532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61532 ÷ 2 = 30766) | 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 | Yes (61532 ÷ 4 = 15383) | 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 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61532 a prime number?
No. 61532 = × 15383, so it is divisible by 2.
What are the factors of 61532?
1, 2, 4, 15383, 30766, 61532.
What is 61532 in binary?
1111000001011100 (hexadecimal F05C, octal 170134).
What is the square root of 61532?
About 248.0564, exactly 2√15383.
Is 61532 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 61532?
It is a composite number with 6 divisors.