The number 10462
10462 is a composite number with 4 divisors. Its prime factorisation is 2 × 5231. Divisors (4): 1, 2, 5231, 10462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10462: a semiprime: 2 × 5231, the product of two primes.
- 2
10462 is composite. Its prime factorisation is
- 3
The divisors add up to 15696; without 10462 itself that is 5234, so 10462 is deficient (5234 is less than 10462). Euler's totient φ(10462) = 5230 numbers up to 10462 share no factor with it.
- 4
The digits of 10462 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10462 = 2 \times 5231 \]
10462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15696 |
| Euler totient φ(n) | 5230 |
| Square | 109453444 |
| Cube | 1145101931128 |
| Square root | 102.283919 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.0462 × |
10462 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and sixty-two |
| Binary (base 2) | 10100011011110 |
| Octal (base 8) | 24336 |
| Hexadecimal (base 16) | 28DE |
| Base 3 | 112100111 |
| As time | 10462 seconds = 2 h 54 min 22 s |
Is 10462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10462 ÷ 2 = 5231) | 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 4) | 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 1) | 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 10462 a prime number?
No. 10462 = 2 × 5231, so it is divisible by 2.
What are the factors of 10462?
1, 2, 5231, 10462.
What is 10462 in binary?
10100011011110 (hexadecimal 28DE, octal 24336).
What is the square root of 10462?
About 102.2839.
Is 10462 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10462?
10462 is a semiprime: 2 × 5231, the product of two primes.