The number 43249
43249 is a composite number with 4 divisors. Its prime factorisation is 61 × 709. Divisors (4): 1, 61, 709, 43249.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 43249: a semiprime: 61 × 709, the product of two primes.
- 2
43249 is composite. Its prime factorisation is
- 3
The divisors add up to 44020; without 43249 itself that is 771, so 43249 is deficient (771 is less than 43249). Euler's totient φ(43249) = 42480 numbers up to 43249 share no factor with it.
- 4
The digits of 43249 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
\[ 43249 = 61 \times 709 \]
43249 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 44020 |
| Euler totient φ(n) | 42480 |
| Square | 1870476001 |
| Cube | 80896216567249 |
| Square root | 207.963939 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 163 |
| Scientific notation | 4.3249 × |
43249 in other forms
| Form | Value |
|---|---|
| In words | forty-three thousand two hundred and forty-nine |
| Binary (base 2) | 1010100011110001 |
| Octal (base 8) | 124361 |
| Hexadecimal (base 16) | A8F1 |
| Base 3 | 2012022211 |
| As time | 43249 seconds = 12 h 0 min 49 s |
Is 43249 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 1) | 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 9) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 43249 a prime number?
No. 43249 = 61 × 709, so it is divisible by 61.
What are the factors of 43249?
1, 61, 709, 43249.
What is 43249 in binary?
1010100011110001 (hexadecimal A8F1, octal 124361).
What is the square root of 43249?
About 207.9639.
Is 43249 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 43249?
43249 is a semiprime: 61 × 709, the product of two primes.