The number 14500
14500 is a composite number with 24 divisors. Its prime factorisation is × × 29. Divisors (24): 1, 2, 4, 5, 10, 20, 25, 29, 50, 58, 100, 116, 125, 145, 250, 290 … 14500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14500: a Harshad number: divisible by its digit sum 10.
- 2
14500 is composite. Its prime factorisation is
- 3
The divisors add up to 32760; without 14500 itself that is 18260, so 14500 is abundant (18260 is more than 14500). Euler's totient φ(14500) = 5600 numbers up to 14500 share no factor with it.
- 4
The digits of 14500 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14500 = 2^{2} \times 5^{3} \times 29 \]14500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 32760 |
| Euler totient φ(n) | 5600 |
| Square | 210250000 |
| Cube | 3048625000000 |
| Square root | 120.415946 (= 10√145) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.45 × |
14500 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred |
| Binary (base 2) | 11100010100100 |
| Octal (base 8) | 34244 |
| Hexadecimal (base 16) | 38A4 |
| Base 3 | 201220001 |
| As time | 14500 seconds = 4 h 1 min 40 s |
Is 14500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14500 ÷ 2 = 7250) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14500 ÷ 4 = 3625) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14500 ÷ 5 = 2900) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14500 ÷ 10 = 1450) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14500 a prime number?
No. 14500 = × × 29, so it is divisible by 2.
What are the factors of 14500?
1, 2, 4, 5, 10, 20, 25, 29, 50, 58, 100, 116, 125, 145, 250, 290, 500, 580, 725, 1450, 2900, 3625, 7250, 14500.
What is 14500 in binary?
11100010100100 (hexadecimal 38A4, octal 34244).
What is the square root of 14500?
About 120.4159, exactly 10√145.
Is 14500 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 14500?
14500 is a Harshad number: divisible by its digit sum 10.