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