The number 32495
32495 is a composite number with 8 divisors. Its prime factorisation is 5 × 67 × 97. Divisors (8): 1, 5, 67, 97, 335, 485, 6499, 32495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32495 is composite. Its prime factorisation is
- 3
The divisors add up to 39984; without 32495 itself that is 7489, so 32495 is deficient (7489 is less than 32495). Euler's totient φ(32495) = 25344 numbers up to 32495 share no factor with it.
- 4
The digits of 32495 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 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32495 = 5 \times 67 \times 97 \]
32495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 39984 |
| Euler totient φ(n) | 25344 |
| Square | 1055925025 |
| Cube | 34312283687375 |
| Square root | 180.263696 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 85 |
| Scientific notation | 3.2495 × |
32495 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand four hundred and ninety-five |
| Binary (base 2) | 111111011101111 |
| Octal (base 8) | 77357 |
| Hexadecimal (base 16) | 7EEF |
| Base 3 | 1122120112 |
| As time | 32495 seconds = 9 h 1 min 35 s |
Is 32495 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (32495 ÷ 5 = 6499) | 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 | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32495 a prime number?
No. 32495 = 5 × 67 × 97, so it is divisible by 5.
What are the factors of 32495?
1, 5, 67, 97, 335, 485, 6499, 32495.
What is 32495 in binary?
111111011101111 (hexadecimal 7EEF, octal 77357).
What is the square root of 32495?
About 180.2637.
Is 32495 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 32495?
It is a composite number with 8 divisors.