The number 39068
39068 is a composite number with 6 divisors. Its prime factorisation is × 9767. Divisors (6): 1, 2, 4, 9767, 19534, 39068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39068: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
39068 is composite. Its prime factorisation is
- 3
The divisors add up to 68376; without 39068 itself that is 29308, so 39068 is deficient (29308 is less than 39068). Euler's totient φ(39068) = 19532 numbers up to 39068 share no factor with it.
- 4
The digits of 39068 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39068 = 2^{2} \times 9767 \]39068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 68376 |
| Euler totient φ(n) | 19532 |
| Square | 1526308624 |
| Cube | 59629825322432 |
| Square root | 197.656267 (= 2√9767) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.9068 × |
39068 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and sixty-eight |
| Binary (base 2) | 1001100010011100 |
| Octal (base 8) | 114234 |
| Hexadecimal (base 16) | 989C |
| Base 3 | 1222120222 |
| As time | 39068 seconds = 10 h 51 min 8 s |
Is 39068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39068 ÷ 2 = 19534) | 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 | Yes (39068 ÷ 4 = 9767) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39068 a prime number?
No. 39068 = × 9767, so it is divisible by 2.
What are the factors of 39068?
1, 2, 4, 9767, 19534, 39068.
What is 39068 in binary?
1001100010011100 (hexadecimal 989C, octal 114234).
What is the square root of 39068?
About 197.6563, exactly 2√9767.
Is 39068 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 39068?
39068 is a happy number: repeatedly adding the squares of its digits reaches 1.