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