The number 14521
14521 is a composite number with 4 divisors. Its prime factorisation is 13 × 1117. Divisors (4): 1, 13, 1117, 14521.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14521: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1117, the product of two primes.
- 2
14521 is composite. Its prime factorisation is
- 3
The divisors add up to 15652; without 14521 itself that is 1131, so 14521 is deficient (1131 is less than 14521). Euler's totient φ(14521) = 13392 numbers up to 14521 share no factor with it.
- 4
The digits of 14521 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14521 = 13 \times 1117 \]
14521 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15652 |
| Euler totient φ(n) | 13392 |
| Square | 210859441 |
| Cube | 3061889942761 |
| Square root | 120.503112 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4521 × |
14521 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and twenty-one |
| Binary (base 2) | 11100010111001 |
| Octal (base 8) | 34271 |
| Hexadecimal (base 16) | 38B9 |
| Base 3 | 201220211 |
| As time | 14521 seconds = 4 h 2 min 1 s |
Is 14521 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 1) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14521 a prime number?
No. 14521 = 13 × 1117, so it is divisible by 13.
What are the factors of 14521?
1, 13, 1117, 14521.
What is 14521 in binary?
11100010111001 (hexadecimal 38B9, octal 34271).
What is the square root of 14521?
About 120.5031.
Is 14521 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 14521?
14521 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1117, the product of two primes.