The number 40501
40501 is a composite number with 4 divisors. Its prime factorisation is 101 × 401. Divisors (4): 1, 101, 401, 40501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40501: a semiprime: 101 × 401, the product of two primes.
- 2
40501 is composite. Its prime factorisation is
- 3
The divisors add up to 41004; without 40501 itself that is 503, so 40501 is deficient (503 is less than 40501). Euler's totient φ(40501) = 40000 numbers up to 40501 share no factor with it.
- 4
The digits of 40501 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40501 = 101 \times 401 \]
40501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41004 |
| Euler totient φ(n) | 40000 |
| Square | 1640331001 |
| Cube | 66435045871501 |
| Square root | 201.248602 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.0501 × |
40501 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and one |
| Binary (base 2) | 1001111000110101 |
| Octal (base 8) | 117065 |
| Hexadecimal (base 16) | 9E35 |
| Base 3 | 2001120001 |
| As time | 40501 seconds = 11 h 15 min 1 s |
Is 40501 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40501 a prime number?
No. 40501 = 101 × 401, so it is divisible by 101.
What are the factors of 40501?
1, 101, 401, 40501.
What is 40501 in binary?
1001111000110101 (hexadecimal 9E35, octal 117065).
What is the square root of 40501?
About 201.2486.
Is 40501 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 40501?
40501 is a semiprime: 101 × 401, the product of two primes.