The number 54671
54671 is a composite number with 4 divisors. Its prime factorisation is 23 × 2377. Divisors (4): 1, 23, 2377, 54671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 54671: a Harshad number: divisible by its digit sum 23; a semiprime: 23 × 2377, the product of two primes.
- 2
54671 is composite. Its prime factorisation is
- 3
The divisors add up to 57072; without 54671 itself that is 2401, so 54671 is deficient (2401 is less than 54671). Euler's totient φ(54671) = 52272 numbers up to 54671 share no factor with it.
- 4
The digits of 54671 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54671 = 23 \times 2377 \]
54671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57072 |
| Euler totient φ(n) | 52272 |
| Square | 2988918241 |
| Cube | 163407149153711 |
| Square root | 233.818306 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.4671 × |
54671 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand six hundred and seventy-one |
| Binary (base 2) | 1101010110001111 |
| Octal (base 8) | 152617 |
| Hexadecimal (base 16) | D58F |
| Base 3 | 2202222212 |
| As time | 54671 seconds = 15 h 11 min 11 s |
Is 54671 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 54671 a prime number?
No. 54671 = 23 × 2377, so it is divisible by 23.
What are the factors of 54671?
1, 23, 2377, 54671.
What is 54671 in binary?
1101010110001111 (hexadecimal D58F, octal 152617).
What is the square root of 54671?
About 233.8183.
Is 54671 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 54671?
54671 is a Harshad number: divisible by its digit sum 23; a semiprime: 23 × 2377, the product of two primes.