The number 39051
39051 is a composite number with 6 divisors. Its prime factorisation is × 4339. Divisors (6): 1, 3, 9, 4339, 13017, 39051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39051 is composite. Its prime factorisation is
- 3
The divisors add up to 56420; without 39051 itself that is 17369, so 39051 is deficient (17369 is less than 39051). Euler's totient φ(39051) = 26028 numbers up to 39051 share no factor with it.
- 4
The digits of 39051 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39051 = 3^{2} \times 4339 \]39051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 56420 |
| Euler totient φ(n) | 26028 |
| Square | 1524980601 |
| Cube | 59552017449651 |
| Square root | 197.613259 (= 3√4339) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 106 |
| Scientific notation | 3.9051 × |
39051 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and fifty-one |
| Binary (base 2) | 1001100010001011 |
| Octal (base 8) | 114213 |
| Hexadecimal (base 16) | 988B |
| Base 3 | 1222120100 |
| As time | 39051 seconds = 10 h 50 min 51 s |
Is 39051 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 (39051 ÷ 3 = 13017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (39051 ÷ 9 = 4339) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39051 a prime number?
No. 39051 = × 4339, so it is divisible by 3.
What are the factors of 39051?
1, 3, 9, 4339, 13017, 39051.
What is 39051 in binary?
1001100010001011 (hexadecimal 988B, octal 114213).
What is the square root of 39051?
About 197.6133, exactly 3√4339.
Is 39051 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 39051?
It is a composite number with 6 divisors.