The number 13481
13481 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 61. Divisors (8): 1, 13, 17, 61, 221, 793, 1037, 13481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13481: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
13481 is composite. Its prime factorisation is
- 3
The divisors add up to 15624; without 13481 itself that is 2143, so 13481 is deficient (2143 is less than 13481). Euler's totient φ(13481) = 11520 numbers up to 13481 share no factor with it.
- 4
The digits of 13481 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13481 = 13 \times 17 \times 61 \]
13481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15624 |
| Euler totient φ(n) | 11520 |
| Square | 181737361 |
| Cube | 2450001363641 |
| Square root | 116.107709 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.3481 × |
13481 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and eighty-one |
| Binary (base 2) | 11010010101001 |
| Octal (base 8) | 32251 |
| Hexadecimal (base 16) | 34A9 |
| Base 3 | 200111022 |
| As time | 13481 seconds = 3 h 44 min 41 s |
Is 13481 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13481 a prime number?
No. 13481 = 13 × 17 × 61, so it is divisible by 13.
What are the factors of 13481?
1, 13, 17, 61, 221, 793, 1037, 13481.
What is 13481 in binary?
11010010101001 (hexadecimal 34A9, octal 32251).
What is the square root of 13481?
About 116.1077.
Is 13481 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 13481?
13481 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.