The number 31461
31461 is a composite number with 4 divisors. Its prime factorisation is 3 × 10487. Divisors (4): 1, 3, 10487, 31461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31461: a semiprime: 3 × 10487, the product of two primes.
- 2
31461 is composite. Its prime factorisation is
- 3
The divisors add up to 41952; without 31461 itself that is 10491, so 31461 is deficient (10491 is less than 31461). Euler's totient φ(31461) = 20972 numbers up to 31461 share no factor with it.
- 4
The digits of 31461 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 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31461 = 3 \times 10487 \]
31461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41952 |
| Euler totient φ(n) | 20972 |
| Square | 989794521 |
| Cube | 31139925425181 |
| Square root | 177.372489 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 54 |
| Scientific notation | 3.1461 × |
31461 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand four hundred and sixty-one |
| Binary (base 2) | 111101011100101 |
| Octal (base 8) | 75345 |
| Hexadecimal (base 16) | 7AE5 |
| Base 3 | 1121011020 |
| As time | 31461 seconds = 8 h 44 min 21 s |
Is 31461 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 (31461 ÷ 3 = 10487) | 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 3) | 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 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 1) | 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 31461 a prime number?
No. 31461 = 3 × 10487, so it is divisible by 3.
What are the factors of 31461?
1, 3, 10487, 31461.
What is 31461 in binary?
111101011100101 (hexadecimal 7AE5, octal 75345).
What is the square root of 31461?
About 177.3725.
Is 31461 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 31461?
31461 is a semiprime: 3 × 10487, the product of two primes.