The number 4251
4251 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 109. Divisors (8): 1, 3, 13, 39, 109, 327, 1417, 4251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4251 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4251 is composite. Its prime factorisation is
- 3
The divisors add up to 6160; without 4251 itself that is 1909, so 4251 is deficient (1909 is less than 4251). Euler's totient φ(4251) = 2592 numbers up to 4251 share no factor with it.
- 4
The digits of 4251 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 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4251 = 3 \times 13 \times 109 \]
4251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6160 |
| Euler totient φ(n) | 2592 |
| Square | 18071001 |
| Cube | 76819825251 |
| Square root | 65.199693 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 82 |
| Scientific notation | 4.251 × |
4251 in other forms
| Form | Value |
|---|---|
| In words | four thousand two hundred and fifty-one |
| Binary (base 2) | 1000010011011 |
| Octal (base 8) | 10233 |
| Hexadecimal (base 16) | 109B |
| Base 3 | 12211110 |
| As time | 4251 seconds = 1 h 10 min 51 s |
Is 4251 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 (4251 ÷ 3 = 1417) | 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 2) | 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 5) | 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 4251 a prime number?
No. 4251 = 3 × 13 × 109, so it is divisible by 3.
What are the factors of 4251?
1, 3, 13, 39, 109, 327, 1417, 4251.
What is 4251 in binary?
1000010011011 (hexadecimal 109B, octal 10233).
What is the square root of 4251?
About 65.1997.
Is 4251 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 4251?
It is a composite number with 8 divisors.