The number 13301
13301 is a composite number with 4 divisors. Its prime factorisation is 47 × 283. Divisors (4): 1, 47, 283, 13301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13301: a semiprime: 47 × 283, the product of two primes.
- 2
13301 is composite. Its prime factorisation is
- 3
The divisors add up to 13632; without 13301 itself that is 331, so 13301 is deficient (331 is less than 13301). Euler's totient φ(13301) = 12972 numbers up to 13301 share no factor with it.
- 4
The digits of 13301 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13301 = 47 \times 283 \]
13301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13632 |
| Euler totient φ(n) | 12972 |
| Square | 176916601 |
| Cube | 2353167709901 |
| Square root | 115.329961 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 138 |
| Scientific notation | 1.3301 × |
13301 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and one |
| Binary (base 2) | 11001111110101 |
| Octal (base 8) | 31765 |
| Hexadecimal (base 16) | 33F5 |
| Base 3 | 200020122 |
| As time | 13301 seconds = 3 h 41 min 41 s |
Is 13301 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 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 5) | 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 2) | 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 13301 a prime number?
No. 13301 = 47 × 283, so it is divisible by 47.
What are the factors of 13301?
1, 47, 283, 13301.
What is 13301 in binary?
11001111110101 (hexadecimal 33F5, octal 31765).
What is the square root of 13301?
About 115.3300.
Is 13301 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 13301?
13301 is a semiprime: 47 × 283, the product of two primes.