The number 6251
6251 is a composite number with 8 divisors. Its prime factorisation is 7 × 19 × 47. Divisors (8): 1, 7, 19, 47, 133, 329, 893, 6251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6251 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6251 is composite. Its prime factorisation is
- 3
The divisors add up to 7680; without 6251 itself that is 1429, so 6251 is deficient (1429 is less than 6251). Euler's totient φ(6251) = 4968 numbers up to 6251 share no factor with it.
- 4
The digits of 6251 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 111 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6251 = 7 \times 19 \times 47 \]
6251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7680 |
| Euler totient φ(n) | 4968 |
| Square | 39075001 |
| Cube | 244257831251 |
| Square root | 79.063266 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 111 |
| Scientific notation | 6.251 × |
6251 in other forms
| Form | Value |
|---|---|
| In words | six thousand two hundred and fifty-one |
| Binary (base 2) | 1100001101011 |
| Octal (base 8) | 14153 |
| Hexadecimal (base 16) | 186B |
| Base 3 | 22120112 |
| As time | 6251 seconds = 1 h 44 min 11 s |
Is 6251 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (6251 ÷ 7 = 893) | 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 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6251 a prime number?
No. 6251 = 7 × 19 × 47, so it is divisible by 7.
What are the factors of 6251?
1, 7, 19, 47, 133, 329, 893, 6251.
What is 6251 in binary?
1100001101011 (hexadecimal 186B, octal 14153).
What is the square root of 6251?
About 79.0633.
Is 6251 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 6251?
It is a composite number with 8 divisors.