The number 5476
5476 is a perfect square (74²). Its prime factorisation is × . Divisors (9): 1, 2, 4, 37, 74, 148, 1369, 2738, 5476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5476: a perfect square (74²).
- 2
5476 is composite. Its prime factorisation is
- 3
The divisors add up to 9849; without 5476 itself that is 4373, so 5476 is deficient (4373 is less than 5476). Euler's totient φ(5476) = 2664 numbers up to 5476 share no factor with it.
- 4
The digits of 5476 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5476 = 2^{2} \times 37^{2} \]5476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 9 |
| Sum of divisors | 9849 |
| Euler totient φ(n) | 2664 |
| Square | 29986576 |
| Cube | 164206490176 |
| Square root | 74 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.476 × |
| Perfect power |
5476 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and seventy-six |
| Binary (base 2) | 1010101100100 |
| Octal (base 8) | 12544 |
| Hexadecimal (base 16) | 1564 |
| Base 3 | 21111211 |
| As time | 5476 seconds = 1 h 31 min 16 s |
Is 5476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5476 ÷ 2 = 2738) | 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 | Yes (5476 ÷ 4 = 1369) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5476 a prime number?
No. 5476 = × , so it is divisible by 2.
What are the factors of 5476?
1, 2, 4, 37, 74, 148, 1369, 2738, 5476.
What is 5476 in binary?
1010101100100 (hexadecimal 1564, octal 12544).
What is the square root of 5476?
74, because 74 × 74 = 5476.
Is 5476 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5476?
5476 is a perfect square (74²).