The number 4061
4061 is a composite number with 4 divisors. Its prime factorisation is 31 × 131. Divisors (4): 1, 31, 131, 4061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4061: a semiprime: 31 × 131, the product of two primes.
- 2
4061 is composite. Its prime factorisation is
- 3
The divisors add up to 4224; without 4061 itself that is 163, so 4061 is deficient (163 is less than 4061). Euler's totient φ(4061) = 3900 numbers up to 4061 share no factor with it.
- 4
The digits of 4061 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 38 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4061 = 31 \times 131 \]
4061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4224 |
| Euler totient φ(n) | 3900 |
| Square | 16491721 |
| Cube | 66972878981 |
| Square root | 63.725976 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 38 |
| Scientific notation | 4.061 × |
4061 in other forms
| Form | Value |
|---|---|
| In words | four thousand and sixty-one |
| Binary (base 2) | 111111011101 |
| Octal (base 8) | 7735 |
| Hexadecimal (base 16) | FDD |
| Base 3 | 12120102 |
| As time | 4061 seconds = 1 h 7 min 41 s |
Is 4061 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 | No (remainder 1) | 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 2) | 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 4061 a prime number?
No. 4061 = 31 × 131, so it is divisible by 31.
What are the factors of 4061?
1, 31, 131, 4061.
What is 4061 in binary?
111111011101 (hexadecimal FDD, octal 7735).
What is the square root of 4061?
About 63.7260.
Is 4061 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 4061?
4061 is a semiprime: 31 × 131, the product of two primes.