The number 51455
51455 is a composite number with 8 divisors. Its prime factorisation is 5 × 41 × 251. Divisors (8): 1, 5, 41, 205, 251, 1255, 10291, 51455.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51455 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51455 is composite. Its prime factorisation is
- 3
The divisors add up to 63504; without 51455 itself that is 12049, so 51455 is deficient (12049 is less than 51455). Euler's totient φ(51455) = 40000 numbers up to 51455 share no factor with it.
- 4
The digits of 51455 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 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51455 = 5 \times 41 \times 251 \]
51455 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63504 |
| Euler totient φ(n) | 40000 |
| Square | 2647617025 |
| Cube | 136233134021375 |
| Square root | 226.836946 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.1455 × |
51455 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and fifty-five |
| Binary (base 2) | 1100100011111111 |
| Octal (base 8) | 144377 |
| Hexadecimal (base 16) | C8FF |
| Base 3 | 2121120202 |
| As time | 51455 seconds = 14 h 17 min 35 s |
Is 51455 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 | Yes (51455 ÷ 5 = 10291) | 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 5) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51455 a prime number?
No. 51455 = 5 × 41 × 251, so it is divisible by 5.
What are the factors of 51455?
1, 5, 41, 205, 251, 1255, 10291, 51455.
What is 51455 in binary?
1100100011111111 (hexadecimal C8FF, octal 144377).
What is the square root of 51455?
About 226.8369.
Is 51455 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51455?
It is a composite number with 8 divisors.