The number 47476
47476 is a composite number with 24 divisors. Its prime factorisation is × 11 × 13 × 83. Divisors (24): 1, 2, 4, 11, 13, 22, 26, 44, 52, 83, 143, 166, 286, 332, 572, 913 … 47476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47476 is composite. Its prime factorisation is
- 3
The divisors add up to 98784; without 47476 itself that is 51308, so 47476 is abundant (51308 is more than 47476). Euler's totient φ(47476) = 19680 numbers up to 47476 share no factor with it.
- 4
The digits of 47476 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47476 = 2^{2} \times 11 \times 13 \times 83 \]47476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 98784 |
| Euler totient φ(n) | 19680 |
| Square | 2253970576 |
| Cube | 107009507066176 |
| Square root | 217.889880 (= 2√11869) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7476 × |
47476 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand four hundred and seventy-six |
| Binary (base 2) | 1011100101110100 |
| Octal (base 8) | 134564 |
| Hexadecimal (base 16) | B974 |
| Base 3 | 2102010101 |
| As time | 47476 seconds = 13 h 11 min 16 s |
Is 47476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47476 ÷ 2 = 23738) | 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 (47476 ÷ 4 = 11869) | 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 1) | 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 | Yes (47476 ÷ 11 = 4316) | 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 47476 a prime number?
No. 47476 = × 11 × 13 × 83, so it is divisible by 2.
What are the factors of 47476?
1, 2, 4, 11, 13, 22, 26, 44, 52, 83, 143, 166, 286, 332, 572, 913, 1079, 1826, 2158, 3652, 4316, 11869, 23738, 47476.
What is 47476 in binary?
1011100101110100 (hexadecimal B974, octal 134564).
What is the square root of 47476?
About 217.8899, exactly 2√11869.
Is 47476 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 47476?
It is a composite number with 24 divisors.