The number 39063
39063 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 449. Divisors (8): 1, 3, 29, 87, 449, 1347, 13021, 39063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39063 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39063 is composite. Its prime factorisation is
- 3
The divisors add up to 54000; without 39063 itself that is 14937, so 39063 is deficient (14937 is less than 39063). Euler's totient φ(39063) = 25088 numbers up to 39063 share no factor with it.
- 4
The digits of 39063 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39063 = 3 \times 29 \times 449 \]
39063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54000 |
| Euler totient φ(n) | 25088 |
| Square | 1525917969 |
| Cube | 59606933623047 |
| Square root | 197.643619 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9063 × |
39063 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and sixty-three |
| Binary (base 2) | 1001100010010111 |
| Octal (base 8) | 114227 |
| Hexadecimal (base 16) | 9897 |
| Base 3 | 1222120210 |
| As time | 39063 seconds = 10 h 51 min 3 s |
Is 39063 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 (39063 ÷ 3 = 13021) | 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 3) | 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 7) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39063 a prime number?
No. 39063 = 3 × 29 × 449, so it is divisible by 3.
What are the factors of 39063?
1, 3, 29, 87, 449, 1347, 13021, 39063.
What is 39063 in binary?
1001100010010111 (hexadecimal 9897, octal 114227).
What is the square root of 39063?
About 197.6436.
Is 39063 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 39063?
It is a composite number with 8 divisors.