The number 43483
43483 is a composite number with 8 divisors. Its prime factorisation is 11 × 59 × 67. Divisors (8): 1, 11, 59, 67, 649, 737, 3953, 43483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
43483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
43483 is composite. Its prime factorisation is
- 3
The divisors add up to 48960; without 43483 itself that is 5477, so 43483 is deficient (5477 is less than 43483). Euler's totient φ(43483) = 38280 numbers up to 43483 share no factor with it.
- 4
The digits of 43483 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 163 steps to reach 1.
LaTeX source of the formulas on this page
\[ 43483 = 11 \times 59 \times 67 \]
43483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 48960 |
| Euler totient φ(n) | 38280 |
| Square | 1890771289 |
| Cube | 82216407959587 |
| Square root | 208.525778 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 163 |
| Scientific notation | 4.3483 × |
43483 in other forms
| Form | Value |
|---|---|
| In words | forty-three thousand four hundred and eighty-three |
| Binary (base 2) | 1010100111011011 |
| Octal (base 8) | 124733 |
| Hexadecimal (base 16) | A9DB |
| Base 3 | 2012122111 |
| As time | 43483 seconds = 12 h 4 min 43 s |
Is 43483 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 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 4) | 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 | Yes (43483 ÷ 11 = 3953) | 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 43483 a prime number?
No. 43483 = 11 × 59 × 67, so it is divisible by 11.
What are the factors of 43483?
1, 11, 59, 67, 649, 737, 3953, 43483.
What is 43483 in binary?
1010100111011011 (hexadecimal A9DB, octal 124733).
What is the square root of 43483?
About 208.5258.
Is 43483 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 43483?
It is a composite number with 8 divisors.