The number 48476
48476 is a composite number with 6 divisors. Its prime factorisation is × 12119. Divisors (6): 1, 2, 4, 12119, 24238, 48476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48476 is composite. Its prime factorisation is
- 3
The divisors add up to 84840; without 48476 itself that is 36364, so 48476 is deficient (36364 is less than 48476). Euler's totient φ(48476) = 24236 numbers up to 48476 share no factor with it.
- 4
The digits of 48476 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48476 = 2^{2} \times 12119 \]48476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 84840 |
| Euler totient φ(n) | 24236 |
| Square | 2349922576 |
| Cube | 113914846794176 |
| Square root | 220.172660 (= 2√12119) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8476 × |
48476 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand four hundred and seventy-six |
| Binary (base 2) | 1011110101011100 |
| Octal (base 8) | 136534 |
| Hexadecimal (base 16) | BD5C |
| Base 3 | 2110111102 |
| As time | 48476 seconds = 13 h 27 min 56 s |
Is 48476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48476 ÷ 2 = 24238) | 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 | Yes (48476 ÷ 4 = 12119) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48476 a prime number?
No. 48476 = × 12119, so it is divisible by 2.
What are the factors of 48476?
1, 2, 4, 12119, 24238, 48476.
What is 48476 in binary?
1011110101011100 (hexadecimal BD5C, octal 136534).
What is the square root of 48476?
About 220.1727, exactly 2√12119.
Is 48476 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 48476?
It is a composite number with 6 divisors.