The number 13650
13650 is a composite number with 48 divisors. Its prime factorisation is 2 × 3 × × 7 × 13. Divisors (48): 1, 2, 3, 5, 6, 7, 10, 13, 14, 15, 21, 25, 26, 30, 35, 39 … 13650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13650: a Harshad number: divisible by its digit sum 15.
- 2
13650 is composite. Its prime factorisation is
- 3
The divisors add up to 41664; without 13650 itself that is 28014, so 13650 is abundant (28014 is more than 13650). Euler's totient φ(13650) = 2880 numbers up to 13650 share no factor with it.
- 4
The digits of 13650 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 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13650 = 2 \times 3 \times 5^{2} \times 7 \times 13 \]13650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 41664 |
| Euler totient φ(n) | 2880 |
| Square | 186322500 |
| Cube | 2543302125000 |
| Square root | 116.833214 (= 5√546) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.365 × |
13650 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and fifty |
| Binary (base 2) | 11010101010010 |
| Octal (base 8) | 32522 |
| Hexadecimal (base 16) | 3552 |
| Base 3 | 200201120 |
| As time | 13650 seconds = 3 h 47 min 30 s |
Is 13650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13650 ÷ 2 = 6825) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13650 ÷ 3 = 4550) | 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 (13650 ÷ 5 = 2730) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (13650 ÷ 6 = 2275) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (13650 ÷ 7 = 1950) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13650 ÷ 10 = 1365) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 13650 a prime number?
No. 13650 = 2 × 3 × × 7 × 13, so it is divisible by 2.
What are the factors of 13650?
1, 2, 3, 5, 6, 7, 10, 13, 14, 15, 21, 25, 26, 30, 35, 39, 42, 50, 65, 70, 75, 78, 91, 105, 130, 150, 175, 182, 195, 210, 273, 325, 350, 390, 455, 525, 546, 650, 910, 975, 1050, 1365, 1950, 2275, 2730, 4550, 6825, 13650.
What is 13650 in binary?
11010101010010 (hexadecimal 3552, octal 32522).
What is the square root of 13650?
About 116.8332, exactly 5√546.
Is 13650 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13650?
13650 is a Harshad number: divisible by its digit sum 15.