The number 54951
54951 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1409. Divisors (8): 1, 3, 13, 39, 1409, 4227, 18317, 54951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
54951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
54951 is composite. Its prime factorisation is
- 3
The divisors add up to 78960; without 54951 itself that is 24009, so 54951 is deficient (24009 is less than 54951). Euler's totient φ(54951) = 33792 numbers up to 54951 share no factor with it.
- 4
The digits of 54951 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54951 = 3 \times 13 \times 1409 \]
54951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78960 |
| Euler totient φ(n) | 33792 |
| Square | 3019612401 |
| Cube | 165930721047351 |
| Square root | 234.416296 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.4951 × |
54951 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand nine hundred and fifty-one |
| Binary (base 2) | 1101011010100111 |
| Octal (base 8) | 153247 |
| Hexadecimal (base 16) | D6A7 |
| Base 3 | 2210101020 |
| As time | 54951 seconds = 15 h 15 min 51 s |
Is 54951 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 (54951 ÷ 3 = 18317) | 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 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 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 6) | 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 54951 a prime number?
No. 54951 = 3 × 13 × 1409, so it is divisible by 3.
What are the factors of 54951?
1, 3, 13, 39, 1409, 4227, 18317, 54951.
What is 54951 in binary?
1101011010100111 (hexadecimal D6A7, octal 153247).
What is the square root of 54951?
About 234.4163.
Is 54951 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 54951?
It is a composite number with 8 divisors.