The number 13483
13483 is a composite number with 4 divisors. Its prime factorisation is 97 × 139. Divisors (4): 1, 97, 139, 13483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13483: a semiprime: 97 × 139, the product of two primes.
- 2
13483 is composite. Its prime factorisation is
- 3
The divisors add up to 13720; without 13483 itself that is 237, so 13483 is deficient (237 is less than 13483). Euler's totient φ(13483) = 13248 numbers up to 13483 share no factor with it.
- 4
The digits of 13483 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13483 = 97 \times 139 \]
13483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13720 |
| Euler totient φ(n) | 13248 |
| Square | 181791289 |
| Cube | 2451091949587 |
| Square root | 116.116321 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3483 × |
13483 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and eighty-three |
| Binary (base 2) | 11010010101011 |
| Octal (base 8) | 32253 |
| Hexadecimal (base 16) | 34AB |
| Base 3 | 200111101 |
| As time | 13483 seconds = 3 h 44 min 43 s |
Is 13483 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13483 a prime number?
No. 13483 = 97 × 139, so it is divisible by 97.
What are the factors of 13483?
1, 97, 139, 13483.
What is 13483 in binary?
11010010101011 (hexadecimal 34AB, octal 32253).
What is the square root of 13483?
About 116.1163.
Is 13483 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 13483?
13483 is a semiprime: 97 × 139, the product of two primes.