The number 39690
39690 is a composite number with 60 divisors. Its prime factorisation is 2 × × 5 × . Divisors (60): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 27, 30, 35, 42 … 39690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39690: a Harshad number: divisible by its digit sum 27.
- 2
39690 is composite. Its prime factorisation is
- 3
The divisors add up to 124146; without 39690 itself that is 84456, so 39690 is abundant (84456 is more than 39690). Euler's totient φ(39690) = 9072 numbers up to 39690 share no factor with it.
- 4
The digits of 39690 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39690 = 2 \times 3^{4} \times 5 \times 7^{2} \]39690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 60 |
| Sum of divisors | 124146 |
| Euler totient φ(n) | 9072 |
| Square | 1575296100 |
| Cube | 62523502209000 |
| Square root | 199.223493 (= 63√10) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.969 × |
39690 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand six hundred and ninety |
| Binary (base 2) | 1001101100001010 |
| Octal (base 8) | 115412 |
| Hexadecimal (base 16) | 9B0A |
| Base 3 | 2000110000 |
| As time | 39690 seconds = 11 h 1 min 30 s |
Is 39690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39690 ÷ 2 = 19845) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (39690 ÷ 3 = 13230) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (39690 ÷ 5 = 7938) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (39690 ÷ 6 = 6615) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (39690 ÷ 7 = 5670) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (39690 ÷ 9 = 4410) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (39690 ÷ 10 = 3969) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39690 a prime number?
No. 39690 = 2 × × 5 × , so it is divisible by 2.
What are the factors of 39690?
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 27, 30, 35, 42, 45, 49, 54, 63, 70, 81, 90, 98, 105, 126, 135, 147, 162, 189, 210, 245, 270, 294, 315, 378, 405, 441, 490, 567, 630, 735, 810, 882, 945, 1134, 1323, 1470, 1890, 2205, 2646, 2835, 3969, 4410, 5670, 6615, 7938, 13230, 19845, 39690.
What is 39690 in binary?
1001101100001010 (hexadecimal 9B0A, octal 115412).
What is the square root of 39690?
About 199.2235, exactly 63√10.
Is 39690 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 39690?
39690 is a Harshad number: divisible by its digit sum 27.