The number 14781
14781 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 379. Divisors (8): 1, 3, 13, 39, 379, 1137, 4927, 14781.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14781 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14781 is composite. Its prime factorisation is
- 3
The divisors add up to 21280; without 14781 itself that is 6499, so 14781 is deficient (6499 is less than 14781). Euler's totient φ(14781) = 9072 numbers up to 14781 share no factor with it.
- 4
The digits of 14781 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14781 = 3 \times 13 \times 379 \]
14781 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21280 |
| Euler totient φ(n) | 9072 |
| Square | 218477961 |
| Cube | 3229322741541 |
| Square root | 121.577136 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 208 |
| Scientific notation | 1.4781 × |
14781 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and eighty-one |
| Binary (base 2) | 11100110111101 |
| Octal (base 8) | 34675 |
| Hexadecimal (base 16) | 39BD |
| Base 3 | 202021110 |
| As time | 14781 seconds = 4 h 6 min 21 s |
Is 14781 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 (14781 ÷ 3 = 4927) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14781 a prime number?
No. 14781 = 3 × 13 × 379, so it is divisible by 3.
What are the factors of 14781?
1, 3, 13, 39, 379, 1137, 4927, 14781.
What is 14781 in binary?
11100110111101 (hexadecimal 39BD, octal 34675).
What is the square root of 14781?
About 121.5771.
Is 14781 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14781?
It is a composite number with 8 divisors.