The number 39476
39476 is a composite number with 12 divisors. Its prime factorisation is × 71 × 139. Divisors (12): 1, 2, 4, 71, 139, 142, 278, 284, 556, 9869, 19738, 39476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39476 is composite. Its prime factorisation is
- 3
The divisors add up to 70560; without 39476 itself that is 31084, so 39476 is deficient (31084 is less than 39476). Euler's totient φ(39476) = 19320 numbers up to 39476 share no factor with it.
- 4
The digits of 39476 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39476 = 2^{2} \times 71 \times 139 \]39476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 70560 |
| Euler totient φ(n) | 19320 |
| Square | 1558354576 |
| Cube | 61517605242176 |
| Square root | 198.685681 (= 2√9869) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9476 × |
39476 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand four hundred and seventy-six |
| Binary (base 2) | 1001101000110100 |
| Octal (base 8) | 115064 |
| Hexadecimal (base 16) | 9A34 |
| Base 3 | 2000011002 |
| As time | 39476 seconds = 10 h 57 min 56 s |
Is 39476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39476 ÷ 2 = 19738) | 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 (39476 ÷ 4 = 9869) | 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 2) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 39476 a prime number?
No. 39476 = × 71 × 139, so it is divisible by 2.
What are the factors of 39476?
1, 2, 4, 71, 139, 142, 278, 284, 556, 9869, 19738, 39476.
What is 39476 in binary?
1001101000110100 (hexadecimal 9A34, octal 115064).
What is the square root of 39476?
About 198.6857, exactly 2√9869.
Is 39476 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 39476?
It is a composite number with 12 divisors.