The number 5055
5055 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 337. Divisors (8): 1, 3, 5, 15, 337, 1011, 1685, 5055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5055: a Harshad number: divisible by its digit sum 15.
- 2
5055 is composite. Its prime factorisation is
- 3
The divisors add up to 8112; without 5055 itself that is 3057, so 5055 is deficient (3057 is less than 5055). Euler's totient φ(5055) = 2688 numbers up to 5055 share no factor with it.
- 4
The digits of 5055 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 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5055 = 3 \times 5 \times 337 \]
5055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8112 |
| Euler totient φ(n) | 2688 |
| Square | 25553025 |
| Cube | 129170541375 |
| Square root | 71.098523 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 85 |
| Scientific notation | 5.055 × |
5055 in other forms
| Form | Value |
|---|---|
| In words | five thousand and fifty-five |
| Binary (base 2) | 1001110111111 |
| Octal (base 8) | 11677 |
| Hexadecimal (base 16) | 13BF |
| Base 3 | 20221020 |
| As time | 5055 seconds = 1 h 24 min 15 s |
Is 5055 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 (5055 ÷ 3 = 1685) | 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 | Yes (5055 ÷ 5 = 1011) | 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 7) | 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 6) | 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 5055 a prime number?
No. 5055 = 3 × 5 × 337, so it is divisible by 3.
What are the factors of 5055?
1, 3, 5, 15, 337, 1011, 1685, 5055.
What is 5055 in binary?
1001110111111 (hexadecimal 13BF, octal 11677).
What is the square root of 5055?
About 71.0985.
Is 5055 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5055?
5055 is a Harshad number: divisible by its digit sum 15.