The number 31462
31462 is a composite number with 4 divisors. Its prime factorisation is 2 × 15731. Divisors (4): 1, 2, 15731, 31462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31462: a semiprime: 2 × 15731, the product of two primes.
- 2
31462 is composite. Its prime factorisation is
- 3
The divisors add up to 47196; without 31462 itself that is 15734, so 31462 is deficient (15734 is less than 31462). Euler's totient φ(31462) = 15730 numbers up to 31462 share no factor with it.
- 4
The digits of 31462 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31462 = 2 \times 15731 \]
31462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47196 |
| Euler totient φ(n) | 15730 |
| Square | 989857444 |
| Cube | 31142894903128 |
| Square root | 177.375308 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 54 |
| Scientific notation | 3.1462 × |
31462 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand four hundred and sixty-two |
| Binary (base 2) | 111101011100110 |
| Octal (base 8) | 75346 |
| Hexadecimal (base 16) | 7AE6 |
| Base 3 | 1121011021 |
| As time | 31462 seconds = 8 h 44 min 22 s |
Is 31462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (31462 ÷ 2 = 15731) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 31462 a prime number?
No. 31462 = 2 × 15731, so it is divisible by 2.
What are the factors of 31462?
1, 2, 15731, 31462.
What is 31462 in binary?
111101011100110 (hexadecimal 7AE6, octal 75346).
What is the square root of 31462?
About 177.3753.
Is 31462 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 31462?
31462 is a semiprime: 2 × 15731, the product of two primes.