The number 56481
56481 is a composite number with 8 divisors. Its prime factorisation is 3 × 67 × 281. Divisors (8): 1, 3, 67, 201, 281, 843, 18827, 56481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56481 is composite. Its prime factorisation is
- 3
The divisors add up to 76704; without 56481 itself that is 20223, so 56481 is deficient (20223 is less than 56481). Euler's totient φ(56481) = 36960 numbers up to 56481 share no factor with it.
- 4
The digits of 56481 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56481 = 3 \times 67 \times 281 \]
56481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76704 |
| Euler totient φ(n) | 36960 |
| Square | 3190103361 |
| Cube | 180180227932641 |
| Square root | 237.657316 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6481 × |
56481 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand four hundred and eighty-one |
| Binary (base 2) | 1101110010100001 |
| Octal (base 8) | 156241 |
| Hexadecimal (base 16) | DCA1 |
| Base 3 | 2212110220 |
| As time | 56481 seconds = 15 h 41 min 21 s |
Is 56481 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 | Yes (56481 ÷ 3 = 18827) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56481 a prime number?
No. 56481 = 3 × 67 × 281, so it is divisible by 3.
What are the factors of 56481?
1, 3, 67, 201, 281, 843, 18827, 56481.
What is 56481 in binary?
1101110010100001 (hexadecimal DCA1, octal 156241).
What is the square root of 56481?
About 237.6573.
Is 56481 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 56481?
It is a composite number with 8 divisors.