The number 61476
61476 is a composite number with 24 divisors. Its prime factorisation is × 3 × 47 × 109. Divisors (24): 1, 2, 3, 4, 6, 12, 47, 94, 109, 141, 188, 218, 282, 327, 436, 564 … 61476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61476 is composite. Its prime factorisation is
- 3
The divisors add up to 147840; without 61476 itself that is 86364, so 61476 is abundant (86364 is more than 61476). Euler's totient φ(61476) = 19872 numbers up to 61476 share no factor with it.
- 4
The digits of 61476 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61476 = 2^{2} \times 3 \times 47 \times 109 \]61476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 147840 |
| Euler totient φ(n) | 19872 |
| Square | 3779298576 |
| Cube | 232336159258176 |
| Square root | 247.943542 (= 2√15369) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 104 |
| Scientific notation | 6.1476 × |
61476 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand four hundred and seventy-six |
| Binary (base 2) | 1111000000100100 |
| Octal (base 8) | 170044 |
| Hexadecimal (base 16) | F024 |
| Base 3 | 10010022220 |
| As time | 61476 seconds = 17 h 4 min 36 s |
Is 61476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (61476 ÷ 2 = 30738) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (61476 ÷ 3 = 20492) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (61476 ÷ 4 = 15369) | 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 | Yes (61476 ÷ 6 = 10246) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | Yes (61476 ÷ 12 = 5123) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 61476 a prime number?
No. 61476 = × 3 × 47 × 109, so it is divisible by 2.
What are the factors of 61476?
1, 2, 3, 4, 6, 12, 47, 94, 109, 141, 188, 218, 282, 327, 436, 564, 654, 1308, 5123, 10246, 15369, 20492, 30738, 61476.
What is 61476 in binary?
1111000000100100 (hexadecimal F024, octal 170044).
What is the square root of 61476?
About 247.9435, exactly 2√15369.
Is 61476 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 61476?
It is a composite number with 24 divisors.