The number 31641
31641 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 199. Divisors (8): 1, 3, 53, 159, 199, 597, 10547, 31641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
31641 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
31641 is composite. Its prime factorisation is
- 3
The divisors add up to 43200; without 31641 itself that is 11559, so 31641 is deficient (11559 is less than 31641). Euler's totient φ(31641) = 20592 numbers up to 31641 share no factor with it.
- 4
The digits of 31641 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 77 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31641 = 3 \times 53 \times 199 \]
31641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 43200 |
| Euler totient φ(n) | 20592 |
| Square | 1001152881 |
| Cube | 31677478307721 |
| Square root | 177.879172 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 77 |
| Scientific notation | 3.1641 × |
31641 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand six hundred and forty-one |
| Binary (base 2) | 111101110011001 |
| Octal (base 8) | 75631 |
| Hexadecimal (base 16) | 7B99 |
| Base 3 | 1121101220 |
| As time | 31641 seconds = 8 h 47 min 21 s |
Is 31641 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 (31641 ÷ 3 = 10547) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 5) | 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 31641 a prime number?
No. 31641 = 3 × 53 × 199, so it is divisible by 3.
What are the factors of 31641?
1, 3, 53, 159, 199, 597, 10547, 31641.
What is 31641 in binary?
111101110011001 (hexadecimal 7B99, octal 75631).
What is the square root of 31641?
About 177.8792.
Is 31641 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 31641?
It is a composite number with 8 divisors.