The number 36470
36470 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 521. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 521, 1042, 2605, 3647, 5210, 7294, 18235, 36470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36470 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36470 is composite. Its prime factorisation is
- 3
The divisors add up to 75168; without 36470 itself that is 38698, so 36470 is abundant (38698 is more than 36470). Euler's totient φ(36470) = 12480 numbers up to 36470 share no factor with it.
- 4
The digits of 36470 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36470 = 2 \times 5 \times 7 \times 521 \]
36470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 75168 |
| Euler totient φ(n) | 12480 |
| Square | 1330060900 |
| Cube | 48507321023000 |
| Square root | 190.971202 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 62 |
| Scientific notation | 3.647 × |
36470 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand four hundred and seventy |
| Binary (base 2) | 1000111001110110 |
| Octal (base 8) | 107166 |
| Hexadecimal (base 16) | 8E76 |
| Base 3 | 1212000202 |
| As time | 36470 seconds = 10 h 7 min 50 s |
Is 36470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36470 ÷ 2 = 18235) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (36470 ÷ 5 = 7294) | 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 | Yes (36470 ÷ 7 = 5210) | 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 6) | 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 | Yes (36470 ÷ 10 = 3647) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36470 a prime number?
No. 36470 = 2 × 5 × 7 × 521, so it is divisible by 2.
What are the factors of 36470?
1, 2, 5, 7, 10, 14, 35, 70, 521, 1042, 2605, 3647, 5210, 7294, 18235, 36470.
What is 36470 in binary?
1000111001110110 (hexadecimal 8E76, octal 107166).
What is the square root of 36470?
About 190.9712.
Is 36470 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 36470?
It is a composite number with 16 divisors.