The number 14167
14167 is a composite number with 4 divisors. Its prime factorisation is 31 × 457. Divisors (4): 1, 31, 457, 14167.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14167: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 457, the product of two primes.
- 2
14167 is composite. Its prime factorisation is
- 3
The divisors add up to 14656; without 14167 itself that is 489, so 14167 is deficient (489 is less than 14167). Euler's totient φ(14167) = 13680 numbers up to 14167 share no factor with it.
- 4
The digits of 14167 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14167 = 31 \times 457 \]
14167 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14656 |
| Euler totient φ(n) | 13680 |
| Square | 200703889 |
| Cube | 2843371995463 |
| Square root | 119.025207 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4167 × |
14167 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and sixty-seven |
| Binary (base 2) | 11011101010111 |
| Octal (base 8) | 33527 |
| Hexadecimal (base 16) | 3757 |
| Base 3 | 201102201 |
| As time | 14167 seconds = 3 h 56 min 7 s |
Is 14167 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14167 a prime number?
No. 14167 = 31 × 457, so it is divisible by 31.
What are the factors of 14167?
1, 31, 457, 14167.
What is 14167 in binary?
11011101010111 (hexadecimal 3757, octal 33527).
What is the square root of 14167?
About 119.0252.
Is 14167 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14167?
14167 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 457, the product of two primes.