The number 14468
14468 is a composite number with 6 divisors. Its prime factorisation is × 3617. Divisors (6): 1, 2, 4, 3617, 7234, 14468.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14468: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14468 is composite. Its prime factorisation is
- 3
The divisors add up to 25326; without 14468 itself that is 10858, so 14468 is deficient (10858 is less than 14468). Euler's totient φ(14468) = 7232 numbers up to 14468 share no factor with it.
- 4
The digits of 14468 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14468 = 2^{2} \times 3617 \]14468 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 25326 |
| Euler totient φ(n) | 7232 |
| Square | 209323024 |
| Cube | 3028485511232 |
| Square root | 120.283000 (= 2√3617) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4468 × |
14468 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and sixty-eight |
| Binary (base 2) | 11100010000100 |
| Octal (base 8) | 34204 |
| Hexadecimal (base 16) | 3884 |
| Base 3 | 201211212 |
| As time | 14468 seconds = 4 h 1 min 8 s |
Is 14468 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14468 ÷ 2 = 7234) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14468 ÷ 4 = 3617) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14468 a prime number?
No. 14468 = × 3617, so it is divisible by 2.
What are the factors of 14468?
1, 2, 4, 3617, 7234, 14468.
What is 14468 in binary?
11100010000100 (hexadecimal 3884, octal 34204).
What is the square root of 14468?
About 120.2830, exactly 2√3617.
Is 14468 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 14468?
14468 is a happy number: repeatedly adding the squares of its digits reaches 1.