The number 10268
10268 is a composite number with 12 divisors. Its prime factorisation is × 17 × 151. Divisors (12): 1, 2, 4, 17, 34, 68, 151, 302, 604, 2567, 5134, 10268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10268: a Harshad number: divisible by its digit sum 17.
- 2
10268 is composite. Its prime factorisation is
- 3
The divisors add up to 19152; without 10268 itself that is 8884, so 10268 is deficient (8884 is less than 10268). Euler's totient φ(10268) = 4800 numbers up to 10268 share no factor with it.
- 4
The digits of 10268 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10268 = 2^{2} \times 17 \times 151 \]10268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 19152 |
| Euler totient φ(n) | 4800 |
| Square | 105431824 |
| Cube | 1082573968832 |
| Square root | 101.331140 (= 2√2567) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0268 × |
10268 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and sixty-eight |
| Binary (base 2) | 10100000011100 |
| Octal (base 8) | 24034 |
| Hexadecimal (base 16) | 281C |
| Base 3 | 112002022 |
| As time | 10268 seconds = 2 h 51 min 8 s |
Is 10268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10268 ÷ 2 = 5134) | 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 | Yes (10268 ÷ 4 = 2567) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10268 a prime number?
No. 10268 = × 17 × 151, so it is divisible by 2.
What are the factors of 10268?
1, 2, 4, 17, 34, 68, 151, 302, 604, 2567, 5134, 10268.
What is 10268 in binary?
10100000011100 (hexadecimal 281C, octal 24034).
What is the square root of 10268?
About 101.3311, exactly 2√2567.
Is 10268 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 10268?
10268 is a Harshad number: divisible by its digit sum 17.