The number 14151
14151 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 89. Divisors (8): 1, 3, 53, 89, 159, 267, 4717, 14151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14151: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14151 is composite. Its prime factorisation is
- 3
The divisors add up to 19440; without 14151 itself that is 5289, so 14151 is deficient (5289 is less than 14151). Euler's totient φ(14151) = 9152 numbers up to 14151 share no factor with it.
- 4
The digits of 14151 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14151 = 3 \times 53 \times 89 \]
14151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19440 |
| Euler totient φ(n) | 9152 |
| Square | 200250801 |
| Cube | 2833749084951 |
| Square root | 118.957976 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.4151 × |
14151 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and fifty-one |
| Binary (base 2) | 11011101000111 |
| Octal (base 8) | 33507 |
| Hexadecimal (base 16) | 3747 |
| Base 3 | 201102010 |
| As time | 14151 seconds = 3 h 55 min 51 s |
Is 14151 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 | Yes (14151 ÷ 3 = 4717) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14151 a prime number?
No. 14151 = 3 × 53 × 89, so it is divisible by 3.
What are the factors of 14151?
1, 3, 53, 89, 159, 267, 4717, 14151.
What is 14151 in binary?
11011101000111 (hexadecimal 3747, octal 33507).
What is the square root of 14151?
About 118.9580.
Is 14151 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14151?
14151 is a happy number: repeatedly adding the squares of its digits reaches 1.