The number 14128
14128 is a composite number with 10 divisors. Its prime factorisation is × 883. Divisors (10): 1, 2, 4, 8, 16, 883, 1766, 3532, 7064, 14128.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14128: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
14128 is composite. Its prime factorisation is
- 3
The divisors add up to 27404; without 14128 itself that is 13276, so 14128 is deficient (13276 is less than 14128). Euler's totient φ(14128) = 7056 numbers up to 14128 share no factor with it.
- 4
The digits of 14128 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14128 = 2^{4} \times 883 \]14128 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 27404 |
| Euler totient φ(n) | 7056 |
| Square | 199600384 |
| Cube | 2819954225152 |
| Square root | 118.861264 (= 4√883) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.4128 × |
14128 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and twenty-eight |
| Binary (base 2) | 11011100110000 |
| Octal (base 8) | 33460 |
| Hexadecimal (base 16) | 3730 |
| Base 3 | 201101021 |
| As time | 14128 seconds = 3 h 55 min 28 s |
Is 14128 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14128 ÷ 2 = 7064) | 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 (14128 ÷ 4 = 3532) | 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 2) | 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 | Yes (14128 ÷ 8 = 1766) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 4) | 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 14128 a prime number?
No. 14128 = × 883, so it is divisible by 2.
What are the factors of 14128?
1, 2, 4, 8, 16, 883, 1766, 3532, 7064, 14128.
What is 14128 in binary?
11011100110000 (hexadecimal 3730, octal 33460).
What is the square root of 14128?
About 118.8613, exactly 4√883.
Is 14128 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14128?
14128 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.