The number 13461
13461 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 641. Divisors (8): 1, 3, 7, 21, 641, 1923, 4487, 13461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13461 is composite. Its prime factorisation is
- 3
The divisors add up to 20544; without 13461 itself that is 7083, so 13461 is deficient (7083 is less than 13461). Euler's totient φ(13461) = 7680 numbers up to 13461 share no factor with it.
- 4
The digits of 13461 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13461 = 3 \times 7 \times 641 \]
13461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20544 |
| Euler totient φ(n) | 7680 |
| Square | 181198521 |
| Cube | 2439113291181 |
| Square root | 116.021550 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3461 × |
13461 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and sixty-one |
| Binary (base 2) | 11010010010101 |
| Octal (base 8) | 32225 |
| Hexadecimal (base 16) | 3495 |
| Base 3 | 200110120 |
| As time | 13461 seconds = 3 h 44 min 21 s |
Is 13461 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13461 ÷ 3 = 4487) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (13461 ÷ 7 = 1923) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13461 a prime number?
No. 13461 = 3 × 7 × 641, so it is divisible by 3.
What are the factors of 13461?
1, 3, 7, 21, 641, 1923, 4487, 13461.
What is 13461 in binary?
11010010010101 (hexadecimal 3495, octal 32225).
What is the square root of 13461?
About 116.0215.
Is 13461 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13461?
It is a composite number with 8 divisors.