The number 54641
54641 is a composite number with 4 divisors. Its prime factorisation is 101 × 541. Divisors (4): 1, 101, 541, 54641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 54641: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 101 × 541, the product of two primes.
- 2
54641 is composite. Its prime factorisation is
- 3
The divisors add up to 55284; without 54641 itself that is 643, so 54641 is deficient (643 is less than 54641). Euler's totient φ(54641) = 54000 numbers up to 54641 share no factor with it.
- 4
The digits of 54641 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54641 = 101 \times 541 \]
54641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55284 |
| Euler totient φ(n) | 54000 |
| Square | 2985638881 |
| Cube | 163138294096721 |
| Square root | 233.754144 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.4641 × |
54641 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand six hundred and forty-one |
| Binary (base 2) | 1101010101110001 |
| Octal (base 8) | 152561 |
| Hexadecimal (base 16) | D571 |
| Base 3 | 2202221202 |
| As time | 54641 seconds = 15 h 10 min 41 s |
Is 54641 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 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 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 | No (remainder 4) | 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 54641 a prime number?
No. 54641 = 101 × 541, so it is divisible by 101.
What are the factors of 54641?
1, 101, 541, 54641.
What is 54641 in binary?
1101010101110001 (hexadecimal D571, octal 152561).
What is the square root of 54641?
About 233.7541.
Is 54641 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 54641?
54641 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 101 × 541, the product of two primes.