The number 54501
54501 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 491. Divisors (8): 1, 3, 37, 111, 491, 1473, 18167, 54501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
54501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
54501 is composite. Its prime factorisation is
- 3
The divisors add up to 74784; without 54501 itself that is 20283, so 54501 is deficient (20283 is less than 54501). Euler's totient φ(54501) = 35280 numbers up to 54501 share no factor with it.
- 4
The digits of 54501 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54501 = 3 \times 37 \times 491 \]
54501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 74784 |
| Euler totient φ(n) | 35280 |
| Square | 2970359001 |
| Cube | 161887535913501 |
| Square root | 233.454492 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.4501 × |
54501 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand five hundred and one |
| Binary (base 2) | 1101010011100101 |
| Octal (base 8) | 152345 |
| Hexadecimal (base 16) | D4E5 |
| Base 3 | 2202202120 |
| As time | 54501 seconds = 15 h 8 min 21 s |
Is 54501 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 (54501 ÷ 3 = 18167) | 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 6) | 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 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 54501 a prime number?
No. 54501 = 3 × 37 × 491, so it is divisible by 3.
What are the factors of 54501?
1, 3, 37, 111, 491, 1473, 18167, 54501.
What is 54501 in binary?
1101010011100101 (hexadecimal D4E5, octal 152345).
What is the square root of 54501?
About 233.4545.
Is 54501 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 54501?
It is a composite number with 8 divisors.