The number 14968
14968 is a composite number with 8 divisors. Its prime factorisation is × 1871. Divisors (8): 1, 2, 4, 8, 1871, 3742, 7484, 14968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14968 is composite. Its prime factorisation is
- 3
The divisors add up to 28080; without 14968 itself that is 13112, so 14968 is deficient (13112 is less than 14968). Euler's totient φ(14968) = 7480 numbers up to 14968 share no factor with it.
- 4
The digits of 14968 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14968 = 2^{3} \times 1871 \]14968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28080 |
| Euler totient φ(n) | 7480 |
| Square | 224041024 |
| Cube | 3353446047232 |
| Square root | 122.343778 (= 2√3742) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4968 × |
14968 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and sixty-eight |
| Binary (base 2) | 11101001111000 |
| Octal (base 8) | 35170 |
| Hexadecimal (base 16) | 3A78 |
| Base 3 | 202112101 |
| As time | 14968 seconds = 4 h 9 min 28 s |
Is 14968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14968 ÷ 2 = 7484) | 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 (14968 ÷ 4 = 3742) | 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 (14968 ÷ 8 = 1871) | 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 8) | 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 14968 a prime number?
No. 14968 = × 1871, so it is divisible by 2.
What are the factors of 14968?
1, 2, 4, 8, 1871, 3742, 7484, 14968.
What is 14968 in binary?
11101001111000 (hexadecimal 3A78, octal 35170).
What is the square root of 14968?
About 122.3438, exactly 2√3742.
Is 14968 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 14968?
It is a composite number with 8 divisors.