The number 14428
14428 is a composite number with 6 divisors. Its prime factorisation is × 3607. Divisors (6): 1, 2, 4, 3607, 7214, 14428.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14428 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14428 is composite. Its prime factorisation is
- 3
The divisors add up to 25256; without 14428 itself that is 10828, so 14428 is deficient (10828 is less than 14428). Euler's totient φ(14428) = 7212 numbers up to 14428 share no factor with it.
- 4
The digits of 14428 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14428 = 2^{2} \times 3607 \]14428 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 25256 |
| Euler totient φ(n) | 7212 |
| Square | 208167184 |
| Cube | 3003436130752 |
| Square root | 120.116610 (= 2√3607) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4428 × |
14428 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and twenty-eight |
| Binary (base 2) | 11100001011100 |
| Octal (base 8) | 34134 |
| Hexadecimal (base 16) | 385C |
| Base 3 | 201210101 |
| As time | 14428 seconds = 4 h 0 min 28 s |
Is 14428 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14428 ÷ 2 = 7214) | 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 | Yes (14428 ÷ 4 = 3607) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14428 a prime number?
No. 14428 = × 3607, so it is divisible by 2.
What are the factors of 14428?
1, 2, 4, 3607, 7214, 14428.
What is 14428 in binary?
11100001011100 (hexadecimal 385C, octal 34134).
What is the square root of 14428?
About 120.1166, exactly 2√3607.
Is 14428 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14428?
It is a composite number with 6 divisors.