The number 40959
40959 is a composite number with 16 divisors. Its prime factorisation is × 37 × 41. Divisors (16): 1, 3, 9, 27, 37, 41, 111, 123, 333, 369, 999, 1107, 1517, 4551, 13653, 40959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40959: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
40959 is composite. Its prime factorisation is
- 3
The divisors add up to 63840; without 40959 itself that is 22881, so 40959 is deficient (22881 is less than 40959). Euler's totient φ(40959) = 25920 numbers up to 40959 share no factor with it.
- 4
The digits of 40959 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 287 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40959 = 3^{3} \times 37 \times 41 \]40959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 63840 |
| Euler totient φ(n) | 25920 |
| Square | 1677639681 |
| Cube | 68714443694079 |
| Square root | 202.383300 (= 3√4551) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 287 |
| Scientific notation | 4.0959 × |
40959 in other forms
| Form | Value |
|---|---|
| In words | forty thousand nine hundred and fifty-nine |
| Binary (base 2) | 1001111111111111 |
| Octal (base 8) | 117777 |
| Hexadecimal (base 16) | 9FFF |
| Base 3 | 2002012000 |
| As time | 40959 seconds = 11 h 22 min 39 s |
Is 40959 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 (40959 ÷ 3 = 13653) | 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 2) | 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 | Yes (40959 ÷ 9 = 4551) | 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 6) | 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 40959 a prime number?
No. 40959 = × 37 × 41, so it is divisible by 3.
What are the factors of 40959?
1, 3, 9, 27, 37, 41, 111, 123, 333, 369, 999, 1107, 1517, 4551, 13653, 40959.
What is 40959 in binary?
1001111111111111 (hexadecimal 9FFF, octal 117777).
What is the square root of 40959?
About 202.3833, exactly 3√4551.
Is 40959 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 40959?
40959 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.