The number 10251
10251 is a composite number with 12 divisors. Its prime factorisation is × 17 × 67. Divisors (12): 1, 3, 9, 17, 51, 67, 153, 201, 603, 1139, 3417, 10251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10251: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
10251 is composite. Its prime factorisation is
- 3
The divisors add up to 15912; without 10251 itself that is 5661, so 10251 is deficient (5661 is less than 10251). Euler's totient φ(10251) = 6336 numbers up to 10251 share no factor with it.
- 4
The digits of 10251 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10251 = 3^{2} \times 17 \times 67 \]10251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 15912 |
| Euler totient φ(n) | 6336 |
| Square | 105083001 |
| Cube | 1077205843251 |
| Square root | 101.247222 (= 3√1139) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0251 × |
10251 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and fifty-one |
| Binary (base 2) | 10100000001011 |
| Octal (base 8) | 24013 |
| Hexadecimal (base 16) | 280B |
| Base 3 | 112001200 |
| As time | 10251 seconds = 2 h 50 min 51 s |
Is 10251 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 (10251 ÷ 3 = 3417) | 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 3) | 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 | Yes (10251 ÷ 9 = 1139) | 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 10) | 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 10251 a prime number?
No. 10251 = × 17 × 67, so it is divisible by 3.
What are the factors of 10251?
1, 3, 9, 17, 51, 67, 153, 201, 603, 1139, 3417, 10251.
What is 10251 in binary?
10100000001011 (hexadecimal 280B, octal 24013).
What is the square root of 10251?
About 101.2472, exactly 3√1139.
Is 10251 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 10251?
10251 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.