The number 13050
13050 is a composite number with 36 divisors. Its prime factorisation is 2 × × × 29. Divisors (36): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 29, 30, 45, 50, 58, 75 … 13050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13050: a Harshad number: divisible by its digit sum 9.
- 2
13050 is composite. Its prime factorisation is
- 3
The divisors add up to 36270; without 13050 itself that is 23220, so 13050 is abundant (23220 is more than 13050). Euler's totient φ(13050) = 3360 numbers up to 13050 share no factor with it.
- 4
The digits of 13050 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13050 = 2 \times 3^{2} \times 5^{2} \times 29 \]13050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 36270 |
| Euler totient φ(n) | 3360 |
| Square | 170302500 |
| Cube | 2222447625000 |
| Square root | 114.236597 (= 15√58) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 138 |
| Scientific notation | 1.305 × |
13050 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand and fifty |
| Binary (base 2) | 11001011111010 |
| Octal (base 8) | 31372 |
| Hexadecimal (base 16) | 32FA |
| Base 3 | 122220100 |
| As time | 13050 seconds = 3 h 37 min 30 s |
Is 13050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13050 ÷ 2 = 6525) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13050 ÷ 3 = 4350) | 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 (13050 ÷ 5 = 2610) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (13050 ÷ 6 = 2175) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (13050 ÷ 9 = 1450) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13050 ÷ 10 = 1305) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13050 a prime number?
No. 13050 = 2 × × × 29, so it is divisible by 2.
What are the factors of 13050?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 29, 30, 45, 50, 58, 75, 87, 90, 145, 150, 174, 225, 261, 290, 435, 450, 522, 725, 870, 1305, 1450, 2175, 2610, 4350, 6525, 13050.
What is 13050 in binary?
11001011111010 (hexadecimal 32FA, octal 31372).
What is the square root of 13050?
About 114.2366, exactly 15√58.
Is 13050 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 13050?
13050 is a Harshad number: divisible by its digit sum 9.