The number 553
553 is a composite number with 4 divisors. Its prime factorisation is 7 × 79. Divisors (4): 1, 7, 79, 553.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 553: a semiprime: 7 × 79, the product of two primes.
- 2
553 is composite. Its prime factorisation is
- 3
The divisors add up to 640; without 553 itself that is 87, so 553 is deficient (87 is less than 553). Euler's totient φ(553) = 468 numbers up to 553 share no factor with it.
- 4
The digits of 553 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 553 = 7 \times 79 \]
553 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 640 |
| Euler totient φ(n) | 468 |
| Square | 305809 |
| Cube | 169112377 |
| Square root | 23.515952 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 136 |
| Scientific notation | 5.53 × |
553 in other forms
| Form | Value |
|---|---|
| In words | five hundred and fifty-three |
| Roman numerals | DLIII |
| Binary (base 2) | 1000101001 |
| Octal (base 8) | 1051 |
| Hexadecimal (base 16) | 229 |
| Base 3 | 202111 |
| As time | 553 seconds = 9 min 13 s |
Is 553 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (553 ÷ 7 = 79) | 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 4) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 553 a prime number?
No. 553 = 7 × 79, so it is divisible by 7.
What are the factors of 553?
1, 7, 79, 553.
What is 553 in binary?
1000101001 (hexadecimal 229, octal 1051).
What is the square root of 553?
About 23.5160.
What is 553 in Roman numerals?
DLIII.
Is 553 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 553?
553 is a semiprime: 7 × 79, the product of two primes.