The number 41470
41470 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 11 × 13 × 29. Divisors (32): 1, 2, 5, 10, 11, 13, 22, 26, 29, 55, 58, 65, 110, 130, 143, 145 … 41470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41470: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
41470 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 41470 itself that is 49250, so 41470 is abundant (49250 is more than 41470). Euler's totient φ(41470) = 13440 numbers up to 41470 share no factor with it.
- 4
The digits of 41470 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41470 = 2 \times 5 \times 11 \times 13 \times 29 \]
41470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 13440 |
| Square | 1719760900 |
| Cube | 71318484523000 |
| Square root | 203.641842 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 150 |
| Scientific notation | 4.147 × |
41470 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand four hundred and seventy |
| Binary (base 2) | 1010000111111110 |
| Octal (base 8) | 120776 |
| Hexadecimal (base 16) | A1FE |
| Base 3 | 2002212221 |
| As time | 41470 seconds = 11 h 31 min 10 s |
Is 41470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (41470 ÷ 2 = 20735) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (41470 ÷ 5 = 8294) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (41470 ÷ 10 = 4147) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (41470 ÷ 11 = 3770) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41470 a prime number?
No. 41470 = 2 × 5 × 11 × 13 × 29, so it is divisible by 2.
What are the factors of 41470?
1, 2, 5, 10, 11, 13, 22, 26, 29, 55, 58, 65, 110, 130, 143, 145, 286, 290, 319, 377, 638, 715, 754, 1430, 1595, 1885, 3190, 3770, 4147, 8294, 20735, 41470.
What is 41470 in binary?
1010000111111110 (hexadecimal A1FE, octal 120776).
What is the square root of 41470?
About 203.6418.
Is 41470 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 41470?
41470 is a happy number: repeatedly adding the squares of its digits reaches 1.