The number 5505
5505 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 367. Divisors (8): 1, 3, 5, 15, 367, 1101, 1835, 5505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5505: a Harshad number: divisible by its digit sum 15.
- 2
5505 is composite. Its prime factorisation is
- 3
The divisors add up to 8832; without 5505 itself that is 3327, so 5505 is deficient (3327 is less than 5505). Euler's totient φ(5505) = 2928 numbers up to 5505 share no factor with it.
- 4
The digits of 5505 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 191 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5505 = 3 \times 5 \times 367 \]
5505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8832 |
| Euler totient φ(n) | 2928 |
| Square | 30305025 |
| Cube | 166829162625 |
| Square root | 74.195687 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 191 |
| Scientific notation | 5.505 × |
5505 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and five |
| Binary (base 2) | 1010110000001 |
| Octal (base 8) | 12601 |
| Hexadecimal (base 16) | 1581 |
| Base 3 | 21112220 |
| As time | 5505 seconds = 1 h 31 min 45 s |
Is 5505 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 (5505 ÷ 3 = 1835) | 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 | Yes (5505 ÷ 5 = 1101) | 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 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5505 a prime number?
No. 5505 = 3 × 5 × 367, so it is divisible by 3.
What are the factors of 5505?
1, 3, 5, 15, 367, 1101, 1835, 5505.
What is 5505 in binary?
1010110000001 (hexadecimal 1581, octal 12601).
What is the square root of 5505?
About 74.1957.
Is 5505 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5505?
5505 is a Harshad number: divisible by its digit sum 15.