The number 14502
14502 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2417. Divisors (8): 1, 2, 3, 6, 2417, 4834, 7251, 14502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14502 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14502 is composite. Its prime factorisation is
- 3
The divisors add up to 29016; without 14502 itself that is 14514, so 14502 is abundant (14514 is more than 14502). Euler's totient φ(14502) = 4832 numbers up to 14502 share no factor with it.
- 4
The digits of 14502 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14502 = 2 \times 3 \times 2417 \]
14502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29016 |
| Euler totient φ(n) | 4832 |
| Square | 210308004 |
| Cube | 3049886674008 |
| Square root | 120.424250 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4502 × |
14502 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and two |
| Binary (base 2) | 11100010100110 |
| Octal (base 8) | 34246 |
| Hexadecimal (base 16) | 38A6 |
| Base 3 | 201220010 |
| As time | 14502 seconds = 4 h 1 min 42 s |
Is 14502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14502 ÷ 2 = 7251) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14502 ÷ 3 = 4834) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (14502 ÷ 6 = 2417) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14502 a prime number?
No. 14502 = 2 × 3 × 2417, so it is divisible by 2.
What are the factors of 14502?
1, 2, 3, 6, 2417, 4834, 7251, 14502.
What is 14502 in binary?
11100010100110 (hexadecimal 38A6, octal 34246).
What is the square root of 14502?
About 120.4243.
Is 14502 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 14502?
It is a composite number with 8 divisors.