The number 14751
14751 is a composite number with 12 divisors. Its prime factorisation is × 11 × 149. Divisors (12): 1, 3, 9, 11, 33, 99, 149, 447, 1341, 1639, 4917, 14751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14751 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14751 is composite. Its prime factorisation is
- 3
The divisors add up to 23400; without 14751 itself that is 8649, so 14751 is deficient (8649 is less than 14751). Euler's totient φ(14751) = 8880 numbers up to 14751 share no factor with it.
- 4
The digits of 14751 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14751 = 3^{2} \times 11 \times 149 \]14751 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 23400 |
| Euler totient φ(n) | 8880 |
| Square | 217592001 |
| Cube | 3209699606751 |
| Square root | 121.453695 (= 3√1639) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4751 × |
14751 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and fifty-one |
| Binary (base 2) | 11100110011111 |
| Octal (base 8) | 34637 |
| Hexadecimal (base 16) | 399F |
| Base 3 | 202020100 |
| As time | 14751 seconds = 4 h 5 min 51 s |
Is 14751 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 (14751 ÷ 3 = 4917) | 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 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14751 ÷ 9 = 1639) | 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 | Yes (14751 ÷ 11 = 1341) | 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 14751 a prime number?
No. 14751 = × 11 × 149, so it is divisible by 3.
What are the factors of 14751?
1, 3, 9, 11, 33, 99, 149, 447, 1341, 1639, 4917, 14751.
What is 14751 in binary?
11100110011111 (hexadecimal 399F, octal 34637).
What is the square root of 14751?
About 121.4537, exactly 3√1639.
Is 14751 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14751?
It is a composite number with 12 divisors.