The number 39701
39701 is a composite number with 6 divisors. Its prime factorisation is 29 Ć . Divisors (6): 1, 29, 37, 1073, 1369, 39701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39701 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39701 is composite. Its prime factorisation is
- 3
The divisors add up to 42210; without 39701 itself that is 2509, so 39701 is deficient (2509 is less than 39701). Euler's totient Ļ(39701) = 37296 numbers up to 39701 share no factor with it.
- 4
The digits of 39701 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39701 = 29 \times 37^{2} \]39701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 42210 |
| Euler totient Ļ(n) | 37296 |
| Square | 1576169401 |
| Cube | 62575501389101 |
| Square root | 199.251098 (= 37ā29) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 44 |
| Scientific notation | 3.9701 Ć |
39701 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand seven hundred and one |
| Binary (base 2) | 1001101100010101 |
| Octal (base 8) | 115425 |
| Hexadecimal (base 16) | 9B15 |
| Base 3 | 2000110102 |
| As time | 39701 seconds = 11 h 1 min 41 s |
Is 39701 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 4) | 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 39701 a prime number?
No. 39701 = 29 Ć , so it is divisible by 29.
What are the factors of 39701?
1, 29, 37, 1073, 1369, 39701.
What is 39701 in binary?
1001101100010101 (hexadecimal 9B15, octal 115425).
What is the square root of 39701?
About 199.2511, exactly 37ā29.
Is 39701 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 39701?
It is a composite number with 6 divisors.