The number 32695
32695 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 503. Divisors (8): 1, 5, 13, 65, 503, 2515, 6539, 32695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32695 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32695 is composite. Its prime factorisation is
- 3
The divisors add up to 42336; without 32695 itself that is 9641, so 32695 is deficient (9641 is less than 32695). Euler's totient φ(32695) = 24096 numbers up to 32695 share no factor with it.
- 4
The digits of 32695 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32695 = 5 \times 13 \times 503 \]
32695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 42336 |
| Euler totient φ(n) | 24096 |
| Square | 1068963025 |
| Cube | 34949746102375 |
| Square root | 180.817588 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.2695 × |
32695 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand six hundred and ninety-five |
| Binary (base 2) | 111111110110111 |
| Octal (base 8) | 77667 |
| Hexadecimal (base 16) | 7FB7 |
| Base 3 | 1122211221 |
| As time | 32695 seconds = 9 h 4 min 55 s |
Is 32695 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 | Yes (32695 ÷ 5 = 6539) | 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 5) | 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 7) | 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 3) | 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 32695 a prime number?
No. 32695 = 5 × 13 × 503, so it is divisible by 5.
What are the factors of 32695?
1, 5, 13, 65, 503, 2515, 6539, 32695.
What is 32695 in binary?
111111110110111 (hexadecimal 7FB7, octal 77667).
What is the square root of 32695?
About 180.8176.
Is 32695 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 32695?
It is a composite number with 8 divisors.