The number 54670
54670 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 11 × 71. Divisors (32): 1, 2, 5, 7, 10, 11, 14, 22, 35, 55, 70, 71, 77, 110, 142, 154 … 54670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 54670: a Harshad number: divisible by its digit sum 22.
- 2
54670 is composite. Its prime factorisation is
- 3
The divisors add up to 124416; without 54670 itself that is 69746, so 54670 is abundant (69746 is more than 54670). Euler's totient φ(54670) = 16800 numbers up to 54670 share no factor with it.
- 4
The digits of 54670 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54670 = 2 \times 5 \times 7 \times 11 \times 71 \]
54670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 124416 |
| Euler totient φ(n) | 16800 |
| Square | 2988808900 |
| Cube | 163398182563000 |
| Square root | 233.816167 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.467 × |
54670 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand six hundred and seventy |
| Binary (base 2) | 1101010110001110 |
| Octal (base 8) | 152616 |
| Hexadecimal (base 16) | D58E |
| Base 3 | 2202222211 |
| As time | 54670 seconds = 15 h 11 min 10 s |
Is 54670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (54670 ÷ 2 = 27335) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (54670 ÷ 5 = 10934) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (54670 ÷ 7 = 7810) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (54670 ÷ 10 = 5467) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (54670 ÷ 11 = 4970) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 54670 a prime number?
No. 54670 = 2 × 5 × 7 × 11 × 71, so it is divisible by 2.
What are the factors of 54670?
1, 2, 5, 7, 10, 11, 14, 22, 35, 55, 70, 71, 77, 110, 142, 154, 355, 385, 497, 710, 770, 781, 994, 1562, 2485, 3905, 4970, 5467, 7810, 10934, 27335, 54670.
What is 54670 in binary?
1101010110001110 (hexadecimal D58E, octal 152616).
What is the square root of 54670?
About 233.8162.
Is 54670 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 54670?
54670 is a Harshad number: divisible by its digit sum 22.