The number 13351
13351 is a composite number with 6 divisors. Its prime factorisation is Ć 79. Divisors (6): 1, 13, 79, 169, 1027, 13351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13351: a Harshad number: divisible by its digit sum 13.
- 2
13351 is composite. Its prime factorisation is
- 3
The divisors add up to 14640; without 13351 itself that is 1289, so 13351 is deficient (1289 is less than 13351). Euler's totient Ļ(13351) = 12168 numbers up to 13351 share no factor with it.
- 4
The digits of 13351 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13351 = 13^{2} \times 79 \]13351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 14640 |
| Euler totient Ļ(n) | 12168 |
| Square | 178249201 |
| Cube | 2379805082551 |
| Square root | 115.546527 (= 13ā79) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.3351 Ć |
13351 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and fifty-one |
| Binary (base 2) | 11010000100111 |
| Octal (base 8) | 32047 |
| Hexadecimal (base 16) | 3427 |
| Base 3 | 200022111 |
| As time | 13351 seconds = 3 h 42 min 31 s |
Is 13351 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13351 a prime number?
No. 13351 = Ć 79, so it is divisible by 13.
What are the factors of 13351?
1, 13, 79, 169, 1027, 13351.
What is 13351 in binary?
11010000100111 (hexadecimal 3427, octal 32047).
What is the square root of 13351?
About 115.5465, exactly 13ā79.
Is 13351 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 13351?
13351 is a Harshad number: divisible by its digit sum 13.