The number 4269
4269 is a composite number with 4 divisors. Its prime factorisation is 3 × 1423. Divisors (4): 1, 3, 1423, 4269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4269: a semiprime: 3 × 1423, the product of two primes.
- 2
4269 is composite. Its prime factorisation is
- 3
The divisors add up to 5696; without 4269 itself that is 1427, so 4269 is deficient (1427 is less than 4269). Euler's totient φ(4269) = 2844 numbers up to 4269 share no factor with it.
- 4
The digits of 4269 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4269 = 3 \times 1423 \]
4269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5696 |
| Euler totient φ(n) | 2844 |
| Square | 18224361 |
| Cube | 77799797109 |
| Square root | 65.337585 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 64 |
| Scientific notation | 4.269 × |
4269 in other forms
| Form | Value |
|---|---|
| In words | four thousand two hundred and sixty-nine |
| Binary (base 2) | 1000010101101 |
| Octal (base 8) | 10255 |
| Hexadecimal (base 16) | 10AD |
| Base 3 | 12212010 |
| As time | 4269 seconds = 1 h 11 min 9 s |
Is 4269 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 (4269 ÷ 3 = 1423) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4269 a prime number?
No. 4269 = 3 × 1423, so it is divisible by 3.
What are the factors of 4269?
1, 3, 1423, 4269.
What is 4269 in binary?
1000010101101 (hexadecimal 10AD, octal 10255).
What is the square root of 4269?
About 65.3376.
Is 4269 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4269?
4269 is a semiprime: 3 × 1423, the product of two primes.