The number 5151
5151 is a triangular number: 1 + 2 + … + 101 = 5151. Its prime factorisation is 3 × 17 × 101. Divisors (8): 1, 3, 17, 51, 101, 303, 1717, 5151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5151: a triangular number: 1 + 2 + … + 101 = 5151.
- 2
5151 is composite. Its prime factorisation is
- 3
The divisors add up to 7344; without 5151 itself that is 2193, so 5151 is deficient (2193 is less than 5151). Euler's totient φ(5151) = 3200 numbers up to 5151 share no factor with it.
- 4
The digits of 5151 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5151 = 3 \times 17 \times 101 \]
5151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7344 |
| Euler totient φ(n) | 3200 |
| Square | 26532801 |
| Cube | 136670457951 |
| Square root | 71.770467 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 90 |
| Scientific notation | 5.151 × |
5151 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and fifty-one |
| Binary (base 2) | 1010000011111 |
| Octal (base 8) | 12037 |
| Hexadecimal (base 16) | 141F |
| Base 3 | 21001210 |
| As time | 5151 seconds = 1 h 25 min 51 s |
Is 5151 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 (5151 ÷ 3 = 1717) | 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 | No (remainder 1) | 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 6) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5151 a prime number?
No. 5151 = 3 × 17 × 101, so it is divisible by 3.
What are the factors of 5151?
1, 3, 17, 51, 101, 303, 1717, 5151.
What is 5151 in binary?
1010000011111 (hexadecimal 141F, octal 12037).
What is the square root of 5151?
About 71.7705.
Is 5151 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 5151?
5151 is a triangular number: 1 + 2 + … + 101 = 5151.