The number 52481
52481 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 367. Divisors (8): 1, 11, 13, 143, 367, 4037, 4771, 52481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52481 is composite. Its prime factorisation is
- 3
The divisors add up to 61824; without 52481 itself that is 9343, so 52481 is deficient (9343 is less than 52481). Euler's totient φ(52481) = 43920 numbers up to 52481 share no factor with it.
- 4
The digits of 52481 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52481 = 11 \times 13 \times 367 \]
52481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61824 |
| Euler totient φ(n) | 43920 |
| Square | 2754255361 |
| Cube | 144546075600641 |
| Square root | 229.087320 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.2481 × |
52481 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and eighty-one |
| Binary (base 2) | 1100110100000001 |
| Octal (base 8) | 146401 |
| Hexadecimal (base 16) | CD01 |
| Base 3 | 2122222202 |
| As time | 52481 seconds = 14 h 34 min 41 s |
Is 52481 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 | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (52481 ÷ 11 = 4771) | 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 52481 a prime number?
No. 52481 = 11 × 13 × 367, so it is divisible by 11.
What are the factors of 52481?
1, 11, 13, 143, 367, 4037, 4771, 52481.
What is 52481 in binary?
1100110100000001 (hexadecimal CD01, octal 146401).
What is the square root of 52481?
About 229.0873.
Is 52481 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 52481?
It is a composite number with 8 divisors.