The number 13371
13371 is a composite number with 4 divisors. Its prime factorisation is 3 × 4457. Divisors (4): 1, 3, 4457, 13371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13371: a semiprime: 3 × 4457, the product of two primes.
- 2
13371 is composite. Its prime factorisation is
- 3
The divisors add up to 17832; without 13371 itself that is 4461, so 13371 is deficient (4461 is less than 13371). Euler's totient φ(13371) = 8912 numbers up to 13371 share no factor with it.
- 4
The digits of 13371 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13371 = 3 \times 4457 \]
13371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17832 |
| Euler totient φ(n) | 8912 |
| Square | 178783641 |
| Cube | 2390516063811 |
| Square root | 115.633040 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.3371 × |
13371 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and seventy-one |
| Binary (base 2) | 11010000111011 |
| Octal (base 8) | 32073 |
| Hexadecimal (base 16) | 343B |
| Base 3 | 200100020 |
| As time | 13371 seconds = 3 h 42 min 51 s |
Is 13371 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 (13371 ÷ 3 = 4457) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | 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 3) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13371 a prime number?
No. 13371 = 3 × 4457, so it is divisible by 3.
What are the factors of 13371?
1, 3, 4457, 13371.
What is 13371 in binary?
11010000111011 (hexadecimal 343B, octal 32073).
What is the square root of 13371?
About 115.6330.
Is 13371 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13371?
13371 is a semiprime: 3 × 4457, the product of two primes.