The number 12462
12462 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 31 × 67. Divisors (16): 1, 2, 3, 6, 31, 62, 67, 93, 134, 186, 201, 402, 2077, 4154, 6231, 12462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12462 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12462 is composite. Its prime factorisation is
- 3
The divisors add up to 26112; without 12462 itself that is 13650, so 12462 is abundant (13650 is more than 12462). Euler's totient φ(12462) = 3960 numbers up to 12462 share no factor with it.
- 4
The digits of 12462 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 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12462 = 2 \times 3 \times 31 \times 67 \]
12462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26112 |
| Euler totient φ(n) | 3960 |
| Square | 155301444 |
| Cube | 1935366595128 |
| Square root | 111.633328 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2462 × |
12462 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-two |
| Binary (base 2) | 11000010101110 |
| Octal (base 8) | 30256 |
| Hexadecimal (base 16) | 30AE |
| Base 3 | 122002120 |
| As time | 12462 seconds = 3 h 27 min 42 s |
Is 12462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12462 ÷ 2 = 6231) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12462 ÷ 3 = 4154) | 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 | Yes (12462 ÷ 6 = 2077) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12462 a prime number?
No. 12462 = 2 × 3 × 31 × 67, so it is divisible by 2.
What are the factors of 12462?
1, 2, 3, 6, 31, 62, 67, 93, 134, 186, 201, 402, 2077, 4154, 6231, 12462.
What is 12462 in binary?
11000010101110 (hexadecimal 30AE, octal 30256).
What is the square root of 12462?
About 111.6333.
Is 12462 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12462?
It is a composite number with 16 divisors.