The number 14483
14483 is a composite number with 4 divisors. Its prime factorisation is 7 × 2069. Divisors (4): 1, 7, 2069, 14483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14483: a semiprime: 7 × 2069, the product of two primes.
- 2
14483 is composite. Its prime factorisation is
- 3
The divisors add up to 16560; without 14483 itself that is 2077, so 14483 is deficient (2077 is less than 14483). Euler's totient φ(14483) = 12408 numbers up to 14483 share no factor with it.
- 4
The digits of 14483 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14483 = 7 \times 2069 \]
14483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16560 |
| Euler totient φ(n) | 12408 |
| Square | 209757289 |
| Cube | 3037914816587 |
| Square root | 120.345336 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.4483 × |
14483 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and eighty-three |
| Binary (base 2) | 11100010010011 |
| Octal (base 8) | 34223 |
| Hexadecimal (base 16) | 3893 |
| Base 3 | 201212102 |
| As time | 14483 seconds = 4 h 1 min 23 s |
Is 14483 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 3) | 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 | Yes (14483 ÷ 7 = 2069) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 14483 a prime number?
No. 14483 = 7 × 2069, so it is divisible by 7.
What are the factors of 14483?
1, 7, 2069, 14483.
What is 14483 in binary?
11100010010011 (hexadecimal 3893, octal 34223).
What is the square root of 14483?
About 120.3453.
Is 14483 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14483?
14483 is a semiprime: 7 × 2069, the product of two primes.