The number 651
651 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 31. Divisors (8): 1, 3, 7, 21, 31, 93, 217, 651.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
651 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
651 is composite. Its prime factorisation is
- 3
The divisors add up to 1024; without 651 itself that is 373, so 651 is deficient (373 is less than 651). Euler's totient φ(651) = 360 numbers up to 651 share no factor with it.
- 4
The digits of 651 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 100 steps to reach 1.
LaTeX source of the formulas on this page
\[ 651 = 3 \times 7 \times 31 \]
651 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1024 |
| Euler totient φ(n) | 360 |
| Square | 423801 |
| Cube | 275894451 |
| Square root | 25.514702 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 100 |
| Scientific notation | 6.51 × |
651 in other forms
| Form | Value |
|---|---|
| In words | six hundred and fifty-one |
| Roman numerals | DCLI |
| Binary (base 2) | 1010001011 |
| Octal (base 8) | 1213 |
| Hexadecimal (base 16) | 28B |
| Base 3 | 220010 |
| As time | 651 seconds = 10 min 51 s |
Is 651 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 (651 ÷ 3 = 217) | 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 | Yes (651 ÷ 7 = 93) | 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 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 2) | 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 651 a prime number?
No. 651 = 3 × 7 × 31, so it is divisible by 3.
What are the factors of 651?
1, 3, 7, 21, 31, 93, 217, 651.
What is 651 in binary?
1010001011 (hexadecimal 28B, octal 1213).
What is the square root of 651?
About 25.5147.
What is 651 in Roman numerals?
DCLI.
Is 651 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 651?
It is a composite number with 8 divisors.