The number 13150
13150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 263. Divisors (12): 1, 2, 5, 10, 25, 50, 263, 526, 1315, 2630, 6575, 13150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13150: a Harshad number: divisible by its digit sum 10.
- 2
13150 is composite. Its prime factorisation is
- 3
The divisors add up to 24552; without 13150 itself that is 11402, so 13150 is deficient (11402 is less than 13150). Euler's totient φ(13150) = 5240 numbers up to 13150 share no factor with it.
- 4
The digits of 13150 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13150 = 2 \times 5^{2} \times 263 \]13150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 24552 |
| Euler totient φ(n) | 5240 |
| Square | 172922500 |
| Cube | 2273930875000 |
| Square root | 114.673449 (= 5√526) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.315 × |
13150 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and fifty |
| Binary (base 2) | 11001101011110 |
| Octal (base 8) | 31536 |
| Hexadecimal (base 16) | 335E |
| Base 3 | 200001001 |
| As time | 13150 seconds = 3 h 39 min 10 s |
Is 13150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13150 ÷ 2 = 6575) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13150 ÷ 5 = 2630) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13150 ÷ 10 = 1315) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13150 a prime number?
No. 13150 = 2 × × 263, so it is divisible by 2.
What are the factors of 13150?
1, 2, 5, 10, 25, 50, 263, 526, 1315, 2630, 6575, 13150.
What is 13150 in binary?
11001101011110 (hexadecimal 335E, octal 31536).
What is the square root of 13150?
About 114.6734, exactly 5√526.
Is 13150 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 13150?
13150 is a Harshad number: divisible by its digit sum 10.