The number 43959
43959 is a composite number with 4 divisors. Its prime factorisation is 3 × 14653. Divisors (4): 1, 3, 14653, 43959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 43959: a semiprime: 3 × 14653, the product of two primes.
- 2
43959 is composite. Its prime factorisation is
- 3
The divisors add up to 58616; without 43959 itself that is 14657, so 43959 is deficient (14657 is less than 43959). Euler's totient φ(43959) = 29304 numbers up to 43959 share no factor with it.
- 4
The digits of 43959 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 43959 = 3 \times 14653 \]
43959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58616 |
| Euler totient φ(n) | 29304 |
| Square | 1932393681 |
| Cube | 84946093823079 |
| Square root | 209.664017 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.3959 × |
43959 in other forms
| Form | Value |
|---|---|
| In words | forty-three thousand nine hundred and fifty-nine |
| Binary (base 2) | 1010101110110111 |
| Octal (base 8) | 125667 |
| Hexadecimal (base 16) | ABB7 |
| Base 3 | 2020022010 |
| As time | 43959 seconds = 12 h 12 min 39 s |
Is 43959 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 | Yes (43959 ÷ 3 = 14653) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 43959 a prime number?
No. 43959 = 3 × 14653, so it is divisible by 3.
What are the factors of 43959?
1, 3, 14653, 43959.
What is 43959 in binary?
1010101110110111 (hexadecimal ABB7, octal 125667).
What is the square root of 43959?
About 209.6640.
Is 43959 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 43959?
43959 is a semiprime: 3 × 14653, the product of two primes.