The number 40601
40601 is a composite number with 4 divisors. Its prime factorisation is 11 × 3691. Divisors (4): 1, 11, 3691, 40601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40601: a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 3691, the product of two primes.
- 2
40601 is composite. Its prime factorisation is
- 3
The divisors add up to 44304; without 40601 itself that is 3703, so 40601 is deficient (3703 is less than 40601). Euler's totient φ(40601) = 36900 numbers up to 40601 share no factor with it.
- 4
The digits of 40601 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 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40601 = 11 \times 3691 \]
40601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 44304 |
| Euler totient φ(n) | 36900 |
| Square | 1648441201 |
| Cube | 66928361201801 |
| Square root | 201.496898 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.0601 × |
40601 in other forms
| Form | Value |
|---|---|
| In words | forty thousand six hundred and one |
| Binary (base 2) | 1001111010011001 |
| Octal (base 8) | 117231 |
| Hexadecimal (base 16) | 9E99 |
| Base 3 | 2001200202 |
| As time | 40601 seconds = 11 h 16 min 41 s |
Is 40601 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 1) | 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 | Yes (40601 ÷ 11 = 3691) | 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 40601 a prime number?
No. 40601 = 11 × 3691, so it is divisible by 11.
What are the factors of 40601?
1, 11, 3691, 40601.
What is 40601 in binary?
1001111010011001 (hexadecimal 9E99, octal 117231).
What is the square root of 40601?
About 201.4969.
Is 40601 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 40601?
40601 is a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 3691, the product of two primes.