The number 14507
14507 is a composite number with 4 divisors. Its prime factorisation is 89 × 163. Divisors (4): 1, 89, 163, 14507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14507: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 89 × 163, the product of two primes.
- 2
14507 is composite. Its prime factorisation is
- 3
The divisors add up to 14760; without 14507 itself that is 253, so 14507 is deficient (253 is less than 14507). Euler's totient φ(14507) = 14256 numbers up to 14507 share no factor with it.
- 4
The digits of 14507 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14507 = 89 \times 163 \]
14507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14760 |
| Euler totient φ(n) | 14256 |
| Square | 210453049 |
| Cube | 3053042381843 |
| Square root | 120.445008 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4507 × |
14507 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and seven |
| Binary (base 2) | 11100010101011 |
| Octal (base 8) | 34253 |
| Hexadecimal (base 16) | 38AB |
| Base 3 | 201220022 |
| As time | 14507 seconds = 4 h 1 min 47 s |
Is 14507 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 2) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 14507 a prime number?
No. 14507 = 89 × 163, so it is divisible by 89.
What are the factors of 14507?
1, 89, 163, 14507.
What is 14507 in binary?
11100010101011 (hexadecimal 38AB, octal 34253).
What is the square root of 14507?
About 120.4450.
Is 14507 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14507?
14507 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 89 × 163, the product of two primes.