The number 32701
32701 is a composite number with 4 divisors. Its prime factorisation is 53 × 617. Divisors (4): 1, 53, 617, 32701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32701: a semiprime: 53 × 617, the product of two primes.
- 2
32701 is composite. Its prime factorisation is
- 3
The divisors add up to 33372; without 32701 itself that is 671, so 32701 is deficient (671 is less than 32701). Euler's totient φ(32701) = 32032 numbers up to 32701 share no factor with it.
- 4
The digits of 32701 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32701 = 53 \times 617 \]
32701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 33372 |
| Euler totient φ(n) | 32032 |
| Square | 1069355401 |
| Cube | 34968990968101 |
| Square root | 180.834178 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.2701 × |
32701 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand seven hundred and one |
| Binary (base 2) | 111111110111101 |
| Octal (base 8) | 77675 |
| Hexadecimal (base 16) | 7FBD |
| Base 3 | 1122212011 |
| As time | 32701 seconds = 9 h 5 min 1 s |
Is 32701 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 1) | 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 4) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32701 a prime number?
No. 32701 = 53 × 617, so it is divisible by 53.
What are the factors of 32701?
1, 53, 617, 32701.
What is 32701 in binary?
111111110111101 (hexadecimal 7FBD, octal 77675).
What is the square root of 32701?
About 180.8342.
Is 32701 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 32701?
32701 is a semiprime: 53 × 617, the product of two primes.