The number 14531
14531 is a composite number with 4 divisors. Its prime factorisation is 11 × 1321. Divisors (4): 1, 11, 1321, 14531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14531: a semiprime: 11 × 1321, the product of two primes.
- 2
14531 is composite. Its prime factorisation is
- 3
The divisors add up to 15864; without 14531 itself that is 1333, so 14531 is deficient (1333 is less than 14531). Euler's totient φ(14531) = 13200 numbers up to 14531 share no factor with it.
- 4
The digits of 14531 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14531 = 11 \times 1321 \]
14531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15864 |
| Euler totient φ(n) | 13200 |
| Square | 211149961 |
| Cube | 3068220083291 |
| Square root | 120.544598 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4531 × |
14531 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and thirty-one |
| Binary (base 2) | 11100011000011 |
| Octal (base 8) | 34303 |
| Hexadecimal (base 16) | 38C3 |
| Base 3 | 201221012 |
| As time | 14531 seconds = 4 h 2 min 11 s |
Is 14531 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14531 ÷ 11 = 1321) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14531 a prime number?
No. 14531 = 11 × 1321, so it is divisible by 11.
What are the factors of 14531?
1, 11, 1321, 14531.
What is 14531 in binary?
11100011000011 (hexadecimal 38C3, octal 34303).
What is the square root of 14531?
About 120.5446.
Is 14531 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 14531?
14531 is a semiprime: 11 × 1321, the product of two primes.