The number 54964
54964 is a composite number with 24 divisors. Its prime factorisation is × 7 × 13 × 151. Divisors (24): 1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 151, 182, 302, 364, 604, 1057 … 54964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 54964: a Harshad number: divisible by its digit sum 28.
- 2
54964 is composite. Its prime factorisation is
- 3
The divisors add up to 119168; without 54964 itself that is 64204, so 54964 is abundant (64204 is more than 54964). Euler's totient φ(54964) = 21600 numbers up to 54964 share no factor with it.
- 4
The digits of 54964 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54964 = 2^{2} \times 7 \times 13 \times 151 \]54964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 119168 |
| Euler totient φ(n) | 21600 |
| Square | 3021041296 |
| Cube | 166048513793344 |
| Square root | 234.444023 (= 2√13741) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.4964 × |
54964 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand nine hundred and sixty-four |
| Binary (base 2) | 1101011010110100 |
| Octal (base 8) | 153264 |
| Hexadecimal (base 16) | D6B4 |
| Base 3 | 2210101201 |
| As time | 54964 seconds = 15 h 16 min 4 s |
Is 54964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (54964 ÷ 2 = 27482) | 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 | Yes (54964 ÷ 4 = 13741) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 (54964 ÷ 7 = 7852) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 54964 a prime number?
No. 54964 = × 7 × 13 × 151, so it is divisible by 2.
What are the factors of 54964?
1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 151, 182, 302, 364, 604, 1057, 1963, 2114, 3926, 4228, 7852, 13741, 27482, 54964.
What is 54964 in binary?
1101011010110100 (hexadecimal D6B4, octal 153264).
What is the square root of 54964?
About 234.4440, exactly 2√13741.
Is 54964 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 54964?
54964 is a Harshad number: divisible by its digit sum 28.