The number 54051
54051 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 419. Divisors (8): 1, 3, 43, 129, 419, 1257, 18017, 54051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
54051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
54051 is composite. Its prime factorisation is
- 3
The divisors add up to 73920; without 54051 itself that is 19869, so 54051 is deficient (19869 is less than 54051). Euler's totient φ(54051) = 35112 numbers up to 54051 share no factor with it.
- 4
The digits of 54051 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54051 = 3 \times 43 \times 419 \]
54051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73920 |
| Euler totient φ(n) | 35112 |
| Square | 2921510601 |
| Cube | 157910569494651 |
| Square root | 232.488709 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.4051 × |
54051 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand and fifty-one |
| Binary (base 2) | 1101001100100011 |
| Octal (base 8) | 151443 |
| Hexadecimal (base 16) | D323 |
| Base 3 | 2202010220 |
| As time | 54051 seconds = 15 h 0 min 51 s |
Is 54051 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 (54051 ÷ 3 = 18017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 4) | 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 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 54051 a prime number?
No. 54051 = 3 × 43 × 419, so it is divisible by 3.
What are the factors of 54051?
1, 3, 43, 129, 419, 1257, 18017, 54051.
What is 54051 in binary?
1101001100100011 (hexadecimal D323, octal 151443).
What is the square root of 54051?
About 232.4887.
Is 54051 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 54051?
It is a composite number with 8 divisors.