The number 4268
4268 is a composite number with 12 divisors. Its prime factorisation is × 11 × 97. Divisors (12): 1, 2, 4, 11, 22, 44, 97, 194, 388, 1067, 2134, 4268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4268 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4268 is composite. Its prime factorisation is
- 3
The divisors add up to 8232; without 4268 itself that is 3964, so 4268 is deficient (3964 is less than 4268). Euler's totient φ(4268) = 1920 numbers up to 4268 share no factor with it.
- 4
The digits of 4268 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4268 = 2^{2} \times 11 \times 97 \]4268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 8232 |
| Euler totient φ(n) | 1920 |
| Square | 18215824 |
| Cube | 77745136832 |
| Square root | 65.329932 (= 2√1067) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 64 |
| Scientific notation | 4.268 × |
4268 in other forms
| Form | Value |
|---|---|
| In words | four thousand two hundred and sixty-eight |
| Binary (base 2) | 1000010101100 |
| Octal (base 8) | 10254 |
| Hexadecimal (base 16) | 10AC |
| Base 3 | 12212002 |
| As time | 4268 seconds = 1 h 11 min 8 s |
Is 4268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4268 ÷ 2 = 2134) | 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 (4268 ÷ 4 = 1067) | 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 5) | 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 2) | 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 | Yes (4268 ÷ 11 = 388) | 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 4268 a prime number?
No. 4268 = × 11 × 97, so it is divisible by 2.
What are the factors of 4268?
1, 2, 4, 11, 22, 44, 97, 194, 388, 1067, 2134, 4268.
What is 4268 in binary?
1000010101100 (hexadecimal 10AC, octal 10254).
What is the square root of 4268?
About 65.3299, exactly 2√1067.
Is 4268 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 4268?
It is a composite number with 12 divisors.