The number 10553
10553 is a composite number with 4 divisors. Its prime factorisation is 61 × 173. Divisors (4): 1, 61, 173, 10553.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10553: a semiprime: 61 × 173, the product of two primes.
- 2
10553 is composite. Its prime factorisation is
- 3
The divisors add up to 10788; without 10553 itself that is 235, so 10553 is deficient (235 is less than 10553). Euler's totient φ(10553) = 10320 numbers up to 10553 share no factor with it.
- 4
The digits of 10553 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10553 = 61 \times 173 \]
10553 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10788 |
| Euler totient φ(n) | 10320 |
| Square | 111365809 |
| Cube | 1175243382377 |
| Square root | 102.727796 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.0553 × |
10553 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and fifty-three |
| Binary (base 2) | 10100100111001 |
| Octal (base 8) | 24471 |
| Hexadecimal (base 16) | 2939 |
| Base 3 | 112110212 |
| As time | 10553 seconds = 2 h 55 min 53 s |
Is 10553 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10553 a prime number?
No. 10553 = 61 × 173, so it is divisible by 61.
What are the factors of 10553?
1, 61, 173, 10553.
What is 10553 in binary?
10100100111001 (hexadecimal 2939, octal 24471).
What is the square root of 10553?
About 102.7278.
Is 10553 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10553?
10553 is a semiprime: 61 × 173, the product of two primes.