The number 14269
14269 is a composite number with 4 divisors. Its prime factorisation is 19 × 751. Divisors (4): 1, 19, 751, 14269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14269: a semiprime: 19 × 751, the product of two primes.
- 2
14269 is composite. Its prime factorisation is
- 3
The divisors add up to 15040; without 14269 itself that is 771, so 14269 is deficient (771 is less than 14269). Euler's totient φ(14269) = 13500 numbers up to 14269 share no factor with it.
- 4
The digits of 14269 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14269 = 19 \times 751 \]
14269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15040 |
| Euler totient φ(n) | 13500 |
| Square | 203604361 |
| Cube | 2905230627109 |
| Square root | 119.452920 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 195 |
| Scientific notation | 1.4269 × |
14269 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and sixty-nine |
| Binary (base 2) | 11011110111101 |
| Octal (base 8) | 33675 |
| Hexadecimal (base 16) | 37BD |
| Base 3 | 201120111 |
| As time | 14269 seconds = 3 h 57 min 49 s |
Is 14269 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 | No (remainder 1) | 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14269 a prime number?
No. 14269 = 19 × 751, so it is divisible by 19.
What are the factors of 14269?
1, 19, 751, 14269.
What is 14269 in binary?
11011110111101 (hexadecimal 37BD, octal 33675).
What is the square root of 14269?
About 119.4529.
Is 14269 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14269?
14269 is a semiprime: 19 × 751, the product of two primes.