The number 14765
14765 is a composite number with 4 divisors. Its prime factorisation is 5 × 2953. Divisors (4): 1, 5, 2953, 14765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14765: a semiprime: 5 × 2953, the product of two primes.
- 2
14765 is composite. Its prime factorisation is
- 3
The divisors add up to 17724; without 14765 itself that is 2959, so 14765 is deficient (2959 is less than 14765). Euler's totient φ(14765) = 11808 numbers up to 14765 share no factor with it.
- 4
The digits of 14765 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14765 = 5 \times 2953 \]
14765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17724 |
| Euler totient φ(n) | 11808 |
| Square | 218005225 |
| Cube | 3218847147125 |
| Square root | 121.511316 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4765 × |
14765 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and sixty-five |
| Binary (base 2) | 11100110101101 |
| Octal (base 8) | 34655 |
| Hexadecimal (base 16) | 39AD |
| Base 3 | 202020212 |
| As time | 14765 seconds = 4 h 6 min 5 s |
Is 14765 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 2) | 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 | Yes (14765 ÷ 5 = 2953) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 5) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14765 a prime number?
No. 14765 = 5 × 2953, so it is divisible by 5.
What are the factors of 14765?
1, 5, 2953, 14765.
What is 14765 in binary?
11100110101101 (hexadecimal 39AD, octal 34655).
What is the square root of 14765?
About 121.5113.
Is 14765 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 14765?
14765 is a semiprime: 5 × 2953, the product of two primes.