The number 32558
32558 is a composite number with 8 divisors. Its prime factorisation is 2 × 73 × 223. Divisors (8): 1, 2, 73, 146, 223, 446, 16279, 32558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32558 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32558 is composite. Its prime factorisation is
- 3
The divisors add up to 49728; without 32558 itself that is 17170, so 32558 is deficient (17170 is less than 32558). Euler's totient φ(32558) = 15984 numbers up to 32558 share no factor with it.
- 4
The digits of 32558 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32558 = 2 \times 73 \times 223 \]
32558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 49728 |
| Euler totient φ(n) | 15984 |
| Square | 1060023364 |
| Cube | 34512240685112 |
| Square root | 180.438355 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 116 |
| Scientific notation | 3.2558 × |
32558 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand five hundred and fifty-eight |
| Binary (base 2) | 111111100101110 |
| Octal (base 8) | 77456 |
| Hexadecimal (base 16) | 7F2E |
| Base 3 | 1122122212 |
| As time | 32558 seconds = 9 h 2 min 38 s |
Is 32558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32558 ÷ 2 = 16279) | 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 3) | 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 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 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 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32558 a prime number?
No. 32558 = 2 × 73 × 223, so it is divisible by 2.
What are the factors of 32558?
1, 2, 73, 146, 223, 446, 16279, 32558.
What is 32558 in binary?
111111100101110 (hexadecimal 7F2E, octal 77456).
What is the square root of 32558?
About 180.4384.
Is 32558 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 32558?
It is a composite number with 8 divisors.