The number 13462
13462 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 127. Divisors (8): 1, 2, 53, 106, 127, 254, 6731, 13462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13462 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13462 is composite. Its prime factorisation is
- 3
The divisors add up to 20736; without 13462 itself that is 7274, so 13462 is deficient (7274 is less than 13462). Euler's totient φ(13462) = 6552 numbers up to 13462 share no factor with it.
- 4
The digits of 13462 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13462 = 2 \times 53 \times 127 \]
13462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20736 |
| Euler totient φ(n) | 6552 |
| Square | 181225444 |
| Cube | 2439656927128 |
| Square root | 116.025859 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3462 × |
13462 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and sixty-two |
| Binary (base 2) | 11010010010110 |
| Octal (base 8) | 32226 |
| Hexadecimal (base 16) | 3496 |
| Base 3 | 200110121 |
| As time | 13462 seconds = 3 h 44 min 22 s |
Is 13462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13462 ÷ 2 = 6731) | 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 1) | 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 9) | 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 13462 a prime number?
No. 13462 = 2 × 53 × 127, so it is divisible by 2.
What are the factors of 13462?
1, 2, 53, 106, 127, 254, 6731, 13462.
What is 13462 in binary?
11010010010110 (hexadecimal 3496, octal 32226).
What is the square root of 13462?
About 116.0259.
Is 13462 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 13462?
It is a composite number with 8 divisors.