The number 14505
14505 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 967. Divisors (8): 1, 3, 5, 15, 967, 2901, 4835, 14505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14505: a Harshad number: divisible by its digit sum 15.
- 2
14505 is composite. Its prime factorisation is
- 3
The divisors add up to 23232; without 14505 itself that is 8727, so 14505 is deficient (8727 is less than 14505). Euler's totient φ(14505) = 7728 numbers up to 14505 share no factor with it.
- 4
The digits of 14505 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14505 = 3 \times 5 \times 967 \]
14505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23232 |
| Euler totient φ(n) | 7728 |
| Square | 210395025 |
| Cube | 3051779837625 |
| Square root | 120.436705 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4505 × |
14505 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and five |
| Binary (base 2) | 11100010101001 |
| Octal (base 8) | 34251 |
| Hexadecimal (base 16) | 38A9 |
| Base 3 | 201220020 |
| As time | 14505 seconds = 4 h 1 min 45 s |
Is 14505 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 (14505 ÷ 3 = 4835) | 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 (14505 ÷ 5 = 2901) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 7) | 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 14505 a prime number?
No. 14505 = 3 × 5 × 967, so it is divisible by 3.
What are the factors of 14505?
1, 3, 5, 15, 967, 2901, 4835, 14505.
What is 14505 in binary?
11100010101001 (hexadecimal 38A9, octal 34251).
What is the square root of 14505?
About 120.4367.
Is 14505 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14505?
14505 is a Harshad number: divisible by its digit sum 15.