The number 48461
48461 is a composite number with 12 divisors. Its prime factorisation is × 23 × 43. Divisors (12): 1, 7, 23, 43, 49, 161, 301, 989, 1127, 2107, 6923, 48461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48461: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 23.
- 2
48461 is composite. Its prime factorisation is
- 3
The divisors add up to 60192; without 48461 itself that is 11731, so 48461 is deficient (11731 is less than 48461). Euler's totient φ(48461) = 38808 numbers up to 48461 share no factor with it.
- 4
The digits of 48461 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48461 = 7^{2} \times 23 \times 43 \]48461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 60192 |
| Euler totient φ(n) | 38808 |
| Square | 2348468521 |
| Cube | 113809132996181 |
| Square root | 220.138593 (= 7√989) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8461 × |
48461 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand four hundred and sixty-one |
| Binary (base 2) | 1011110101001101 |
| Octal (base 8) | 136515 |
| Hexadecimal (base 16) | BD4D |
| Base 3 | 2110110212 |
| As time | 48461 seconds = 13 h 27 min 41 s |
Is 48461 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48461 ÷ 7 = 6923) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48461 a prime number?
No. 48461 = × 23 × 43, so it is divisible by 7.
What are the factors of 48461?
1, 7, 23, 43, 49, 161, 301, 989, 1127, 2107, 6923, 48461.
What is 48461 in binary?
1011110101001101 (hexadecimal BD4D, octal 136515).
What is the square root of 48461?
About 220.1386, exactly 7√989.
Is 48461 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48461?
48461 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 23.