The number 40701
40701 is a composite number with 4 divisors. Its prime factorisation is 3 × 13567. Divisors (4): 1, 3, 13567, 40701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40701: a semiprime: 3 × 13567, the product of two primes.
- 2
40701 is composite. Its prime factorisation is
- 3
The divisors add up to 54272; without 40701 itself that is 13571, so 40701 is deficient (13571 is less than 40701). Euler's totient φ(40701) = 27132 numbers up to 40701 share no factor with it.
- 4
The digits of 40701 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40701 = 3 \times 13567 \]
40701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54272 |
| Euler totient φ(n) | 27132 |
| Square | 1656571401 |
| Cube | 67424112592101 |
| Square root | 201.744888 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 181 |
| Scientific notation | 4.0701 × |
40701 in other forms
| Form | Value |
|---|---|
| In words | forty thousand seven hundred and one |
| Binary (base 2) | 1001111011111101 |
| Octal (base 8) | 117375 |
| Hexadecimal (base 16) | 9EFD |
| Base 3 | 2001211110 |
| As time | 40701 seconds = 11 h 18 min 21 s |
Is 40701 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 | Yes (40701 ÷ 3 = 13567) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40701 a prime number?
No. 40701 = 3 × 13567, so it is divisible by 3.
What are the factors of 40701?
1, 3, 13567, 40701.
What is 40701 in binary?
1001111011111101 (hexadecimal 9EFD, octal 117375).
What is the square root of 40701?
About 201.7449.
Is 40701 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 40701?
40701 is a semiprime: 3 × 13567, the product of two primes.