The number 13203
13203 is a triangular number: 1 + 2 + … + 162 = 13203. Its prime factorisation is × 163. Divisors (10): 1, 3, 9, 27, 81, 163, 489, 1467, 4401, 13203.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13203: a triangular number: 1 + 2 + … + 162 = 13203; a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
13203 is composite. Its prime factorisation is
- 3
The divisors add up to 19844; without 13203 itself that is 6641, so 13203 is deficient (6641 is less than 13203). Euler's totient φ(13203) = 8748 numbers up to 13203 share no factor with it.
- 4
The digits of 13203 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13203 = 3^{4} \times 163 \]13203 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 19844 |
| Euler totient φ(n) | 8748 |
| Square | 174319209 |
| Cube | 2301536516427 |
| Square root | 114.904308 (= 9√163) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.3203 × |
13203 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand two hundred and three |
| Binary (base 2) | 11001110010011 |
| Octal (base 8) | 31623 |
| Hexadecimal (base 16) | 3393 |
| Base 3 | 200010000 |
| As time | 13203 seconds = 3 h 40 min 3 s |
Is 13203 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 | Yes (13203 ÷ 3 = 4401) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (13203 ÷ 9 = 1467) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13203 a prime number?
No. 13203 = × 163, so it is divisible by 3.
What are the factors of 13203?
1, 3, 9, 27, 81, 163, 489, 1467, 4401, 13203.
What is 13203 in binary?
11001110010011 (hexadecimal 3393, octal 31623).
What is the square root of 13203?
About 114.9043, exactly 9√163.
Is 13203 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 13203?
13203 is a triangular number: 1 + 2 + … + 162 = 13203; a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.