The number 40061
40061 is a composite number with 8 divisors. Its prime factorisation is 7 × 59 × 97. Divisors (8): 1, 7, 59, 97, 413, 679, 5723, 40061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40061 is composite. Its prime factorisation is
- 3
The divisors add up to 47040; without 40061 itself that is 6979, so 40061 is deficient (6979 is less than 40061). Euler's totient φ(40061) = 33408 numbers up to 40061 share no factor with it.
- 4
The digits of 40061 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40061 = 7 \times 59 \times 97 \]
40061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 47040 |
| Euler totient φ(n) | 33408 |
| Square | 1604883721 |
| Cube | 64293246746981 |
| Square root | 200.152442 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 67 |
| Scientific notation | 4.0061 × |
40061 in other forms
| Form | Value |
|---|---|
| In words | forty thousand and sixty-one |
| Binary (base 2) | 1001110001111101 |
| Octal (base 8) | 116175 |
| Hexadecimal (base 16) | 9C7D |
| Base 3 | 2000221202 |
| As time | 40061 seconds = 11 h 7 min 41 s |
Is 40061 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 1) | 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 | Yes (40061 ÷ 7 = 5723) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40061 a prime number?
No. 40061 = 7 × 59 × 97, so it is divisible by 7.
What are the factors of 40061?
1, 7, 59, 97, 413, 679, 5723, 40061.
What is 40061 in binary?
1001110001111101 (hexadecimal 9C7D, octal 116175).
What is the square root of 40061?
About 200.1524.
Is 40061 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 40061?
It is a composite number with 8 divisors.