The number 40931
40931 is a composite number with 6 divisors. Its prime factorisation is 11 Ć . Divisors (6): 1, 11, 61, 671, 3721, 40931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40931 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40931 is composite. Its prime factorisation is
- 3
The divisors add up to 45396; without 40931 itself that is 4465, so 40931 is deficient (4465 is less than 40931). Euler's totient Ļ(40931) = 36600 numbers up to 40931 share no factor with it.
- 4
The digits of 40931 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40931 = 11 \times 61^{2} \]40931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 45396 |
| Euler totient Ļ(n) | 36600 |
| Square | 1675346761 |
| Cube | 68573618274491 |
| Square root | 202.314112 (= 61ā11) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 137 |
| Scientific notation | 4.0931 Ć |
40931 in other forms
| Form | Value |
|---|---|
| In words | forty thousand nine hundred and thirty-one |
| Binary (base 2) | 1001111111100011 |
| Octal (base 8) | 117743 |
| Hexadecimal (base 16) | 9FE3 |
| Base 3 | 2002010222 |
| As time | 40931 seconds = 11 h 22 min 11 s |
Is 40931 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (40931 Ć· 11 = 3721) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40931 a prime number?
No. 40931 = 11 Ć , so it is divisible by 11.
What are the factors of 40931?
1, 11, 61, 671, 3721, 40931.
What is 40931 in binary?
1001111111100011 (hexadecimal 9FE3, octal 117743).
What is the square root of 40931?
About 202.3141, exactly 61ā11.
Is 40931 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 40931?
It is a composite number with 6 divisors.