The number 5150
5150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 103. Divisors (12): 1, 2, 5, 10, 25, 50, 103, 206, 515, 1030, 2575, 5150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5150 is composite. Its prime factorisation is
- 3
The divisors add up to 9672; without 5150 itself that is 4522, so 5150 is deficient (4522 is less than 5150). Euler's totient φ(5150) = 2040 numbers up to 5150 share no factor with it.
- 4
The digits of 5150 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5150 = 2 \times 5^{2} \times 103 \]5150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 9672 |
| Euler totient φ(n) | 2040 |
| Square | 26522500 |
| Cube | 136590875000 |
| Square root | 71.763500 (= 5√206) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 147 |
| Scientific notation | 5.15 × |
5150 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and fifty |
| Binary (base 2) | 1010000011110 |
| Octal (base 8) | 12036 |
| Hexadecimal (base 16) | 141E |
| Base 3 | 21001202 |
| As time | 5150 seconds = 1 h 25 min 50 s |
Is 5150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5150 ÷ 2 = 2575) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5150 ÷ 5 = 1030) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5150 ÷ 10 = 515) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5150 a prime number?
No. 5150 = 2 × × 103, so it is divisible by 2.
What are the factors of 5150?
1, 2, 5, 10, 25, 50, 103, 206, 515, 1030, 2575, 5150.
What is 5150 in binary?
1010000011110 (hexadecimal 141E, octal 12036).
What is the square root of 5150?
About 71.7635, exactly 5√206.
Is 5150 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 5150?
It is a composite number with 12 divisors.