The number 13476
13476 is a composite number with 12 divisors. Its prime factorisation is × 3 × 1123. Divisors (12): 1, 2, 3, 4, 6, 12, 1123, 2246, 3369, 4492, 6738, 13476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13476 is composite. Its prime factorisation is
- 3
The divisors add up to 31472; without 13476 itself that is 17996, so 13476 is abundant (17996 is more than 13476). Euler's totient φ(13476) = 4488 numbers up to 13476 share no factor with it.
- 4
The digits of 13476 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13476 = 2^{2} \times 3 \times 1123 \]13476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 31472 |
| Euler totient φ(n) | 4488 |
| Square | 181602576 |
| Cube | 2447276314176 |
| Square root | 116.086175 (= 2√3369) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 182 |
| Scientific notation | 1.3476 × |
13476 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and seventy-six |
| Binary (base 2) | 11010010100100 |
| Octal (base 8) | 32244 |
| Hexadecimal (base 16) | 34A4 |
| Base 3 | 200111010 |
| As time | 13476 seconds = 3 h 44 min 36 s |
Is 13476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13476 ÷ 2 = 6738) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13476 ÷ 3 = 4492) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (13476 ÷ 4 = 3369) | 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 | Yes (13476 ÷ 6 = 2246) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 | Yes (13476 ÷ 12 = 1123) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13476 a prime number?
No. 13476 = × 3 × 1123, so it is divisible by 2.
What are the factors of 13476?
1, 2, 3, 4, 6, 12, 1123, 2246, 3369, 4492, 6738, 13476.
What is 13476 in binary?
11010010100100 (hexadecimal 34A4, octal 32244).
What is the square root of 13476?
About 116.0862, exactly 2√3369.
Is 13476 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 13476?
It is a composite number with 12 divisors.