The number 11462
11462 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 521. Divisors (8): 1, 2, 11, 22, 521, 1042, 5731, 11462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11462 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11462 is composite. Its prime factorisation is
- 3
The divisors add up to 18792; without 11462 itself that is 7330, so 11462 is deficient (7330 is less than 11462). Euler's totient φ(11462) = 5200 numbers up to 11462 share no factor with it.
- 4
The digits of 11462 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11462 = 2 \times 11 \times 521 \]
11462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18792 |
| Euler totient φ(n) | 5200 |
| Square | 131377444 |
| Cube | 1505848263128 |
| Square root | 107.060730 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.1462 × |
11462 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and sixty-two |
| Binary (base 2) | 10110011000110 |
| Octal (base 8) | 26306 |
| Hexadecimal (base 16) | 2CC6 |
| Base 3 | 120201112 |
| As time | 11462 seconds = 3 h 11 min 2 s |
Is 11462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11462 ÷ 2 = 5731) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (11462 ÷ 11 = 1042) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11462 a prime number?
No. 11462 = 2 × 11 × 521, so it is divisible by 2.
What are the factors of 11462?
1, 2, 11, 22, 521, 1042, 5731, 11462.
What is 11462 in binary?
10110011000110 (hexadecimal 2CC6, octal 26306).
What is the square root of 11462?
About 107.0607.
Is 11462 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11462?
It is a composite number with 8 divisors.